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.

ref http://blog.csdn.net/ljiabin/article/details/40982153

class MinStack {

    //cc150 page 88, 直接调用java 的内置stack实现即可, 决不能随便用 super给stack命名
    private Stack<Integer> s1 = new Stack<Integer>();
    private Stack<Integer> s2= new Stack<Integer>();
    
    public void push(int x) {
  
      // if(x < getMin()) s2.push(x);
      if(s2.isEmpty() || x <= getMin()) s2.push(x);
        s1.push(x);
    }


    public void pop() {
         
        if (s1.peek().equals(s2.peek()))  
            s2.pop();
        s1.pop();
    }


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


    public int getMin() {
        //if(s2.isEmpty()) return Integer.MAX_VALUE;
       // else 
            return s2.peek();
    
    }
}