[leetcode] #155 Min Stack

[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.

用O(1)的时间找出栈中最小值
https://leetcode.com/problems/min-stack/

解题思路：
1、开一个栈 存储最小值。
2、将需要压入的值与栈顶进行比较，若小于等于则压入minstack。
3、若pop出的值与栈顶的值相等，则minstack也同时pop出。

为何相等的值也许压入，假设相等的最小值不压入， 当栈存在两个相等的最小值，恰好将其中的最小值pop出，则minstack中起初的最小值也跟着pop出，出现wrong answer情况。

class MinStack {
public:
    stack<int> in;
    stack<int> min_stack;
    void push(int x) {
        if (in.empty()) {
            min_stack.push(x);
        } else if (!in.empty() && x <= min_stack.top()) {
            min_stack.push(x);
        }
        in.push(x);
    }

    void pop() {
        if (!in.empty()) {
            if (in.top() == min_stack.top())
                min_stack.pop();
            in.pop();
        }
    }

    int top() {
        if (!in.empty())
        return in.top();
    }

    int getMin() {
        if (!min_stack.empty())
        return min_stack.top();
    }
};