Min Stack

leetCode

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.

设计一个栈，push, pop, top 和取最小元素都要是常数时间，看到讨论里有人以为是只要取最小元素常数时间然后超时。

本来想用内置的Stack类作，看到API下面有句

• A more complete and consistent set of LIFO stack operations is provided by the Deque interface and its implementations, which should be used in preference to this class. For example:

     Deque<Integer> stack = new ArrayDeque<Integer>();

没用过Deque这个接口，实现了一下

	Deque<Integer> stack = new ArrayDeque<Integer>();
	Deque<Integer> minStack = new ArrayDeque<Integer>();

	public void push(int x) {
		if (minStack.isEmpty() || minStack.peek() >= x) {
			minStack.addFirst(x);
		}
		stack.addFirst(x);
    }

    public void pop() {
    	if (minStack.peek() == stack.peek()) {
    		minStack.removeFirst();
    	}
    	stack.removeFirst();
    }

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

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

然后超时了 = = ，换回Stack通过