LeetCode 155.最小栈

https://leetcode-cn.com/problems/min-stack/
1.使用辅助栈

class MinStack {

    Stack<Integer> stack,minStack;

    /** initialize your data structure here. */
    public MinStack() {
        this.stack = new Stack<>();
        this.minStack = new Stack<>();
    }
    
    public void push(int x) {
        stack.push(x);
        //最小栈为空或者x小于等于最小栈的栈顶元素
        if (minStack.isEmpty() || x<=minStack.peek()) {
            minStack.push(x);
        }
    }
    
    public void pop() {
        //普通栈的栈顶元素与最小栈的栈顶元素相同，就一起出栈
        if (stack.pop().equals(minStack.peek())){
             minStack.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();
 */