155. 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.
解法
维护两个栈,一个是是stack,存正常的插入push,弹出pop,取栈顶peek。另一个是最小栈minStack,当stack插入push一个元素时,同时在minStack中插入push当前元素的最小值。当stack弹出pop时,minStack同时也pop,和stack中的元素的个数一一对应。
public class MinStack {
/** initialize your data structure here. */
Stack<Integer> stack;
Stack<Integer> minStack;
public MinStack(){
stack = new Stack<Integer>();
minStack = new Stack<Integer>();
}
public void push(int x){
stack.push(x);
if (minStack.isEmpty()) {
minStack.push(x);
} else {
minStack.push(Math.min(x, minStack.peek()));
}
}
public void pop(){
if (!stack.empty() && !minStack.empty()) {
stack.pop();
minStack.pop();
}
}
public int top(){
if (!stack.empty()) {
return stack.peek();
}
return -1;
}
public int getMin() {
if (!minStack.empty()) {
return minStack.peek();
}
return -1;
}
}
/**
* 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();
*/