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.

class MinStack {
    private Stack<Integer> mStack = new Stack<Integer>();
    private Stack<Integer> mMinStack = new Stack<Integer>();

    public void push(int x) {
        mStack.push(x);
        if (mMinStack.isEmpty()) {
            mMinStack.push(x);
        } else {
            if (x < mMinStack.peek()) {
                mMinStack.push(x);
            } else {
                mMinStack.push(mMinStack.peek());
            }
        }
    }

    public void pop() {
        if (!mStack.isEmpty()) {
            mStack.pop();
            mMinStack.pop();
        }
    }

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

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

leetcode 版本：节省一部分空间，只push 不同的min入minstack；当有重复元素时，重复的min也要被push：

class MinStack {
    private Stack<Integer> mStack = new Stack<Integer>();
    private Stack<Integer> mMinStack = new Stack<Integer>();

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

    public void pop() {
        if (!mStack.isEmpty()) {
            if (mStack.pop().equals(mMinStack.peek())) {
                mMinStack.pop();
            }
        }
    }

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

    public int getMin() {
        return mMinStack.peek();
    }
}