最小栈（栈的最小值）

题目

题源

代码

class MinStack {
    private Deque<Integer> stack;
    private Deque<Integer> miniStack;
    /** initialize your data structure here. */
    public MinStack() {
        stack = new LinkedList<Integer>();
        miniStack = new LinkedList<Integer>();
    }
    
    public void push(int val) {
        stack.offerFirst(val);
        if (miniStack.isEmpty() || miniStack.peekFirst() >= val) {
            miniStack.offerFirst(val);
        }
    }
    
    public void pop() {
        int spop = stack.pollFirst();
        if (miniStack.peekFirst() == spop) {
            miniStack.pollFirst();
        }
    }
    
    public int top() {
        return stack.peekFirst();
    }
    
    public int getMin() {
        if (miniStack.isEmpty()) {

        }
        return miniStack.peekFirst();
    }
}

/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack obj = new MinStack();
 * obj.push(val);
 * obj.pop();
 * int param_3 = obj.top();
 * int param_4 = obj.getMin();
 */