mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
14 lines
475 B
HTML
14 lines
475 B
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(); --> return -3.
|
|
|
|
minStack.pop();
|
|
|
|
minStack.top(); --> return 0.
|
|
|
|
minStack.getMin(); --> return -2.</pre>
|
|
|