leetcode解题之155# Min Stack Java版 （包含min函数的栈）

155. 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.

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.

借用辅助栈，辅助栈栈顶始终是和原来栈顶相对应的最小值。

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) {
		//如果压入栈顶的元素比最小值小，那么最小值栈压入当前值，否则压入最小值栈顶元素。
		if (minStack.isEmpty() || x <= minStack.peek())
			minStack.push(x);
		else
			minStack.push(minStack.peek());
		stack.push(x);
	}

	public void pop() {
		//同时删除最小值栈顶元素
		minStack.pop();
		stack.pop();
	}

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

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

	}
}

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