LeetCode---(155)Min Stack

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

• push(x) -- Push element x onto stack.
• pop() -- Removes the element on top of the stack.
• top() -- Get the top element.
• getMin() -- Retrieve the minimum element in the stack.

class MinStack {
public:
    stack<int> s;
    stack<int> s_min;
    
    void push(int x) {
        s.push(x);
        if(s_min.empty()||x<=s_min.top())
            s_min.push(x);
    }

    void pop() {
        if(s.top()==s_min.top())
            s_min.pop();
        s.pop();
    }

    int top() {
        return s.top();
    }

    int getMin() {
        return s_min.top();
    }
};