Min Stack

参考feliciafay

代码如下：

class MinStack {
private:
    stack<int> majorStack;
    stack<int> minorStack;
public:
    void push(int x) {
        majorStack.push(x);

        if(minorStack.empty() == true)
            minorStack.push(x);
        else {
            if(x <= minorStack.top())
                minorStack.push(x);
        }

    }

    void pop() {
        int tmp;

        if(majorStack.empty() == false) {
            tmp = majorStack.top();
            majorStack.pop();
        }

        if(minorStack.empty() == false) {
            if(tmp == minorStack.top())
                minorStack.pop();
        }


    }

    int top() {
        if(majorStack.empty() == true)
            return -65536;
        return majorStack.top();
    }

    int getMin() {
        if(minorStack.empty() == true)
            return -65536;
        return minorStack.top();
    }
};