【2021秋冬】【剑指offer】30. 包含min函数的栈

两个栈完成操作。B里面存的是当前的最小值。

class MinStack {

    /** initialize your data structure here. */
    Stack<Integer> A;
    Stack<Integer> B;
    public MinStack() {

       A = new Stack<>();
       B = new Stack<>();

    }
    
    public void push(int x) {
        A.push(x);
        if(B.isEmpty() || x <= B.peek())
            B.push(x);       

    }
    
    public void pop() {
        if(A.pop().equals(B.peek())) 
            B.pop();

    }
    
    public int top() {
        return A.peek();

    }
    
    public int min() {
        return B.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.min();
 */