法1:两个栈实现最小栈
class MinStack {
Stack<Integer> stack1;
Stack<Integer> stack2;
public MinStack() {
stack1 = new Stack<>();
stack2 = new Stack<>();
}
public void push(int val) {
stack1.push(val);
if (stack2.isEmpty()) {
stack2.push(val);
} else if (val <= stack2.peek()) {
stack2.push(val);
}
}
public void pop() {
int val = stack1.pop();
if (val == stack2.peek()) { // 注意:这里需要加"=",会有多个最小元素push进来
stack2.pop();
}
}
public int top() {
return stack1.peek();
}
public int getMin() {
return stack2.peek();
}
}