题目链接:https://leetcode.com/problems/min-stack/
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
- push(x) -- Push element x onto stack.
- pop() -- Removes the element on top of the stack.
- top() -- Get the top element.
- getMin() -- Retrieve the minimum element in the stack.
Example:
MinStack minStack = new MinStack(); minStack.push(-2); minStack.push(0); minStack.push(-3); minStack.getMin(); --> Returns -3. minStack.pop(); minStack.top(); --> Returns 0. minStack.getMin(); --> Returns -2.
思路:
这个一个栈的思路是参考评论区的大佬的,确实被秀到了。
在入栈时,如果当前元素恰好成为了当前元素中的最小值,那么就保存入栈前的最小值以及新的最小值,
比如例子中,-2,0,3入栈 后,栈中情况为(从底向上):
(0入栈时,最小值(-2)没有被更新,所以只入栈一次。)
MAX_VALUE,-2,0,-2,-3
而min值的对应值依次为:
MAX_VALUE,-2,-2,-2,-3
当最小值-3被pop出去后,次小值-2回到了栈顶。
AC:
class MinStack {
Stack<Integer> sk=new Stack();
int min=Integer.MAX_VALUE;
/** initialize your data structure here. */
public MinStack() {
}
public void push(int x) {
if(x<=min){
sk.push(min);
min=x;
}
sk.push(x);
}
public void pop() {
if(sk.pop()==min)
min=sk.pop();
}
public int top() {
return sk.peek();
}
public int getMin() {
return min;
}
}
/**
* Your MinStack object will be instantiated and called as such:
* MinStack obj = new MinStack();
* obj.push(x);
* obj.pop();
* int param_3 = obj.top();
* int param_4 = obj.getMin();
*/