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.

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.

题目要求栈的构造、入栈、出栈、取栈顶元素和求栈中元素最小值这些操作时间复杂度都是O（1）。每次push的时候记录栈顶在该位置时的最小值，则求最小值的时候直接用top当索引就能取得最小值。

代码：

class MinStack {
public:
    MinStack() {
        Top=-1;
    }
    
    void push(int x) {
        vec[++Top]=x;
        if(Top==0) Min[0]=x;
        else Min[Top]=min(Min[Top-1],x);
    }
    
    void pop() {
        Top--;
    }
    
    int top() {
        return vec[Top];
    }
    
    int getMin() {
        return Min[Top];
    }
private:
    int Top;
    int vec[10000];
    int Min[10000];
};