Leetcode155. 最小栈

使用双栈

class MinStack {
public:
    stack<int> st, min_st;
    MinStack() {
        min_st.push(INT_MAX);
    }
    
    void push(int val) {
        st.push(val);
        int min_val=min_st.top();
        if(min_val>=val) min_st.push(val);
    }
    
    void pop() {
        int val=st.top();
        st.pop();
        if(val==min_st.top())   min_st.pop();
    }
    
    int top() {
        return st.top();
    }
    
    int getMin() {
        return min_st.top();
    }
};

/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack* obj = new MinStack();
 * obj->push(val);
 * obj->pop();
 * int param_3 = obj->top();
 * int param_4 = obj->getMin();
 */

使用集合

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

    }
    
    void push(int val) {
        st.push(val);
        s.insert(val);
    }
    
    void pop() {
        int val=st.top();
        st.pop();
        s.erase(s.find(val));
    }
    
    int top() {
        return st.top();
    }
    
    int getMin() {
        return *(s.begin());
    }
};

/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack* obj = new MinStack();
 * obj->push(val);
 * obj->pop();
 * int param_3 = obj->top();
 * int param_4 = obj->getMin();
 */