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.

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.

题目要求创造一种新型的栈 可以返回栈中的最小值。
这里 我们通过多建立一个栈 来维护这个最小值（最大值也可以是这种方式）

class MinStack {
public:
    /** initialize your data structure here. */
    stack<int> stackValue;
    stack<int> stackMin;
    MinStack() {
        
    }
    
    void push(int x) {
      stackValue.push(x);
        if(stackMin.empty()||stackMin.top()>=x)
            stackMin.push(x);
    }
    
    void pop() {
       if(stackMin.top()==stackValue.top())
       {
           stackMin.pop();
       }
        stackValue.pop();
    }
    
    int top() {
        return  stackValue.top();
    }
    
    int getMin() {
        return stackMin.top();
    }
};

/**
 * Your MinStack object will be instantiated and called as such:
 * MinStack* obj = new MinStack();
 * obj->push(x);
 * obj->pop();
 * int param_3 = obj->top();
 * int param_4 = obj->getMin();
 */