这道题的思路并不是算很难,使用两个stack,一个正常存储数据,另一个栈顶存储最小值,每当有元素要push的时候,就和上一个元素进行比较,如果上一个元素小,就再次push上一个元素,如果将要push进的元素小,就正常push这个元素。另外注意pop的时候这两个stack都要进行pop,代码如下:
public class MinStack {
private Stack<Integer> stack;
private Stack<Integer> minStack;
/** initialize your data structure here. */
public MinStack() {
stack = new Stack<Integer>();
minStack = new Stack<Integer>();
}
public void push(int x) {
stack.push(x);
if(minStack.empty()){
minStack.push(x);
}else{
minStack.push(Math.min(x, minStack.peek()));
}
}
public void pop() {
minStack.pop();
stack.pop();
}
public int top() {
return stack.peek();
}
public int getMin() {
return minStack.peek();
}
}
/**
* 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();
*/