[数据结构与算法]leetcode155最小栈

设计一个支持 push ，pop ，top 操作，并能在常数时间内检索到最小元素的栈。
push(x) —— 将元素 x 推入栈中。
pop() —— 删除栈顶的元素。
top() —— 获取栈顶元素。
getMin() —— 检索栈中的最小元素。
示例:
输入：
["MinStack","push","push","push","getMin","pop","top","getMin"]
[[],[-2],[0],[-3],[],[],[],[]]
输出：
[null,null,null,null,-3,null,0,-2]
解释：
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin();   --> 返回 -3.
minStack.pop();
minStack.top();      --> 返回 0.
minStack.getMin();   --> 返回 -2.
来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/min-stack

class MinStack {
	private Stack<Integer> s1;
	private Stack<Integer> s2;
    private int k = Integer.MAX_VALUE;
    /** initialize your data structure here. */
    public MinStack() {
		s1 = new Stack<>();
		s2 = new Stack<>();
    }
    public void push(int x) {
		s1.add(x);
		k = Math.min(k,x);
		s2.add(k);
    }
    public void pop() {  
    	s1.pop()
    	s2.pop();
    	k = s2.isEmpty() ? Integer.MAX_VALUE : s2.peek(); 
    }

/**
	public void pop() {
        if(stack.pop().equals(min_stack.peek()))
            min_stack.pop();
    }
**/
    public int top() {
       return s1.peek();
    }
    public int getMin() {
  		return s2.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();
 */