Leetcode 155 Min Stack

链接：https://leetcode.com/problems/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.

Stack<Integer> stackCore;// = new Stack<object>();
    Stack<Integer> stackMin;// = new Stack<object>();
    
    /** initialize your data structure here. */
    public MinStack() {
        stackCore = new Stack<Integer>();
        stackMin =  new Stack<Integer>();
    }
    
    //每次push，都会push一个元素进2个stack。区别只是push元素的内容；
    public void push(int x) {
        stackCore.push(x);
       if(stackMin.isEmpty())
    	   stackMin.push(x);
       else
       {
    	   stackMin.push(Math.min(x, stackMin.peek()));
       }
    }
    
    //每次pop，2个stack都需要pop出来；
    public void pop() {
    	stackMin.pop();
        stackCore.pop();
    }
    
    public int top() {
    	if(!stackCore.isEmpty())
            return stackCore.peek();
    	else
    		return 0;
    }
    
    public int getMin() {
    	return stackMin.peek();
    }