leetcode155: Min Stack

要求：编写一个minStack类，

• 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 

Example:

MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin();   --> Returns -3.
minStack.pop();
minStack.top();      --> Returns 0.
minStack.getMin();   --> Returns -2.

思路：用两个栈

注意：基础问题，因为栈里面放的是对象，比较的时候要求用equal，用==是不行的

public class MinStack {
	private Stack<Integer> stack = new Stack();
	private Stack<Integer> minstack = new Stack();

	/** initialize your data structure here. */
	public MinStack() {

	}

	public void push(int x) {
		stack.push(x);
		if (minstack.isEmpty() || (x <= minstack.peek() && !minstack.isEmpty()))
			minstack.push(x);
	}

	public void pop() {
		if (!stack.isEmpty()) {
			if (stack.peek().equals(minstack.peek()))
				minstack.pop();
			stack.pop();
		}
	}

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

	public int getMin() {
		if (!minstack.isEmpty())
			return minstack.peek();
		else
			return 0;
	}
}