【Leetcode】Min Stack

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

• push(x) -- Push element x onto stack.
• pop() -- Removes the element on top of the stack.
• top() -- Get the top element.
• getMin() -- Retrieve the minimum element in the stack.

采取双栈法，一个正常栈，一个最小栈，最小栈里永远只放最小值。如果正常栈里的最小值pop出去了，最小栈也要把这个值pop出。

class MinStack {
    Stack<Integer> stack;
    Stack<Integer> minStack;
    public MinStack() {
        stack=new Stack<Integer>();
        minStack=new Stack<Integer>();
    }
    
    public void push(int x) {
        if(x<=getMin()) 
            minStack.push(x);
        stack.push(x);
    }

    public void pop() {
        int value = stack.pop();
        if(value==getMin())
            minStack.pop();
    }

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

    public int getMin() {
        if(minStack.isEmpty())
            return Integer.MAX_VALUE;
        return minStack.peek();
    }
}