Leetcode NO.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.

本题实现普通的stack功能还是比较容易，就用STL自带的接口就行，但是，要加一个min stack功能，就不太容易了，所以需要构建一个第二个stack： min stack来维护最小值，代码如下：

class MinStack {
public:
    void push(int x) {
        normalStack.push(x);
        if (minStack.empty() or minStack.top() >= x) {
            minStack.push(x);
        }
    }

    void pop() {
        if (normalStack.top() == minStack.top()) {
            minStack.pop();
        }
        normalStack.pop();
    }

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

    int getMin() {
        return minStack.top();
    }
private:
    stack<int> normalStack;
    stack<int> minStack;
};