力扣 155. 最小栈 栈+思维

https://leetcode-cn.com/problems/min-stack/

思路：用两个栈，第一个栈$s_1$正常做栈的操作，第二个栈$s_2$维持一个单调非升的序列，从而保证最小值就在$s_2$的栈顶，现在考虑怎么维护第二个栈，如果$s_2$为空或者当前要压入的元素$<=s_2.top()$，那么直接将其压到第二个栈内，否则不做任何操作即可。

class MinStack {
public:
    /** initialize your data structure here. */
    stack<int> s1;
    stack<int> s2; //单调下降栈
    MinStack() {
        
    }
    
    void push(int x) {
        s1.push(x);
        if(s2.empty()||x<=s2.top())
            s2.push(x);
    }
    
    void pop() {
        int val=s1.top();
        s1.pop();
        if(val==s2.top())
            s2.pop();
    }
    
    int top() {
        return s1.top();
    }
    
    int getMin() {
        return s2.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();
 */