LeetCode-155. Min Stack

问题：https://leetcode.com/problems/min-stack/?tab=Description
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来实现。s1代表总的占，s2是最小值的栈。
参考C++代码：

class MinStack {
public:
      stack<int> s1;
      stack<int> s2;
      void push(int x){
          if(s1.empty()){
              s1.push(x);
              s2.push(x);
          }
          else{
              if(x<=s2.top()){
                  s2.push(x);
              }
              s1.push(x);
          }
      }
       void pop(){
           if(s1.top()==s2.top()) s2.pop();
           s1.pop();
       }
       int top(){
            return s1.top();
       }
       int getMin(){
           return s2.top();
       }
};