[JavaScript知识库]2022-01-16（剑指 Offer 30. 包含min函数的栈）

class MinStack {
    Stack<Integer> dataStack;
    Stack<Integer> minStack;
    /** initialize your data structure here. */
    public MinStack() {
        dataStack=new Stack<>();
        minStack=new Stack<>();
    }
    
    public void push(int x) {
        if(dataStack.size()==0||x<minStack.peek()){
            minStack.push(x);
        }else{
            minStack.push(minStack.peek());
        }
        dataStack.push(x);
    }
    
    public void pop() {
        minStack.pop();
        dataStack.pop();
    }
    
    public int top() { 
        return dataStack.peek();
    }
    
    public int min() {
        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.min();
 */