思路,建立一个辅助的栈
辅助栈存放最小值
如果push的值小于等于 辅助栈的最顶值(或者辅助栈为空),辅助栈也push
pop时,如果等于 辅助栈的最顶值 辅助栈也pop
辅助栈的最顶值就是最小值!!
import java.util.Stack;
class MinStack {
private Stack<Integer> stack;
private Stack<Integer> ass;
/**
* initialize your data structure here.
*/
public MinStack() {
stack = new Stack<>();
ass = new Stack<>();
}
public void push(int x) {
stack.push(x);
if (ass.isEmpty() || x <= ass.peek()) {
ass.push(x);
}
}
public void pop() {
int x = stack.pop();
if (x == ass.peek()) {
ass.pop();
}
}
public int top() {
return stack.peek();
}
public int min() {
return ass.peek();
}
}