LeetCode 155.最小栈(C++)（ 一个栈同时保存当前值和栈内最小值）

一个栈同时保存当前值和栈内最小值

class MinStack {
public:
    /** initialize your data structure here. */
    MinStack() {
    }
    
    void push(int x) {
        if (st.size() == 0) {
            st.push({x, x});
        } else {
            st.push({x, min(x, st.top().second)});
        }
    }
    
    void pop() {
        st.pop();
    }
    
    int top() {
        return st.top().first;
    }
    
    int getMin() {
        return st.top().second;
    }
private:
    stack<pair<int, int>> st;
};

/**

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