leetcode_c++：栈：Min Stack(155)

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.
Example:
MinStack minStack = new MinStack();
minStack.push(-2);
minStack.push(0);
minStack.push(-3);
minStack.getMin(); –> Returns -3.
minStack.pop();
minStack.top(); –> Returns 0.
minStack.getMin(); –> Returns -2.

//多了一个getMin的方法

---

class MinStack {
private:
    stack<int> stk;
    stack<int> mstk;
public:


    void push(int x) {
        if(mstk.empty()||x<=mstk.top())
            mstk.push(x);
        stk.push(x);
    }

    void pop() {
        if(stk.top()==mstk.top())
            mstk.pop();
        stk.pop();
    }

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

    int getMin() {
        return mstk.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();
 */

---

这里写代码片