LeetCode 155 Min Stack最小栈

1. problem description

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
设计一个支持 push，pop，top 操作，并能在常数时间内检索到最小元素的栈。

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

eg:
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.

法一：用vector作为底层容器

结果：
Runtime: 268 ms, faster than 5.04% of C++ online submissions for Min Stack.
Memory Usage: 16.8 MB, less than 100.00% of C++ online submissions for Min Stack.

protected:
    int get_min;
public:
    /** initialize your data structure here. */
    vector<int> myvec;
    vector<int>::iterator iv;
    MinStack()
    {
    }

    void push(int x)
    {
        if(myvec.empty())
        {
            get_min = x;
        }

        myvec.push_back(x);

    }

    void pop()
    {
        if(!myvec.empty())
        {
            myvec.pop_back();
        }

    }

    int top()
    {
        return myvec.back();
    }

    int getMin()
    {
        iv = myvec.begin();
        get_min = *iv;
        for(; iv != myvec.end(); ++iv)
            {
                if(*iv<get_min)
                {
                    get_min=*iv;
                }
            }
         return get_min;
    }

法二：

class MinStack {
public:
    vector<pair<int, int>> st;
    int mi=INT_MAX;
    MinStack() {
        
    }
    
    void push(int x) {
        mi=(mi>x)?x:mi;
        st.push_back(make_pair(x, mi));
    }
    
    void pop() {
        st.pop_back();
        if(st.size())
            mi=st.back().second;
        else
            mi=INT_MAX;
    }
    
    int top() {
        return st.back().first;
    }
    
    int getMin() {
        return st.back().second;
    }
};