155.最小栈

思路

用两个栈s,min，s进行正常的操作，min用来记录当前s的最小元素。

代码

class MinStack {
public:
    stack<int>s;
    stack<int>min;
    MinStack() {

    }
    
    void push(int x) {
       s.push(x);
       if(min.empty()||x<=min.top())
       min.push(x);
    }
    
    void pop() {
        if(min.top()==s.top())
        min.pop();
        s.pop();
    }
    
    int top() {
        return s.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();
 */

结果