leetcode155：最小栈

设计一个支持 push，pop，top 操作，并能在常数时间内检索到最小元素的栈。

//使用两个栈
class MinStack {
public:
    stack<int> q;
    stack<int> min;
    /** initialize your data structure here. */
    MinStack() {
        
    }
    
    void push(int x) {
        q.push(x);
        if(min.empty() || x <= min.top())
        {
            min.push(x);
            
        }
        else
        {
            min.push(min.top());
        }
    }
    
    void pop() {
        q.pop();
        min.pop();
    }
    
    int top() {
        return q.top();
    }
    
    int getMin() {
        return min.top();
    }
};

/**
 * 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();
 */