leetcode-problemset/leetcode-cn/problem (English)/栈的最小值(English) [min-stack-lcci].html

<p>How would you design a stack which, in addition to push and pop, has a function min which returns the minimum element? Push, pop and min should all operate in 0(1) time.</p>

<p><strong>Example: </strong></p>

<pre>
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin();   --&gt; return -3.
minStack.pop();
minStack.top();      --&gt; return 0.
minStack.getMin();   --&gt; return -2.</pre>
更新国内版力扣题目描述变更 2022-05-02 23:42:43 +08:00			`<p>How would you design a stack which, in addition to push and pop, has a function min which returns the minimum element? Push, pop and min should all operate in 0(1) time.</p>`

			`<p><strong>Example: </strong></p>`

			`<pre>`
			`MinStack minStack = new MinStack();`
			`minStack.push(-2);`
			`minStack.push(0);`
			`minStack.push(-3);`
			`minStack.getMin(); --> return -3.`
			`minStack.pop();`
			`minStack.top(); --> return 0.`
			`minStack.getMin(); --> return -2.</pre>`