[leetcode]155. Min Stack

[leetcode]155. Min Stack

---

Analysis

周末要吃鸡~—— [坚持吖~]

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.
实现一个栈，然后要有栈的push(), pop(), top()操作，并且可以在常量时间里返回栈的最小值，还是蛮有意思的。看到一个博主只用了一个栈来实现，方法很巧妙，可以看一下：https://blog.csdn.net/cloudox_/article/details/53665732

Implement

class MinStack {
public:
    stack<int> myStack;
    stack<int> minVal;
    /** initialize your data structure here. */
    MinStack() {

    }

    void push(int x) {
        if(myStack.empty()){
            myStack.push(x);
            minVal.push(x);
        }
        else{
            myStack.push(x);
            if(x <= minVal.top())
                minVal.push(x);
        }
    }

    void pop() {
        if(myStack.top() == minVal.top())
            minVal.pop();
        myStack.pop();
    }

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

    int getMin() {
        return minVal.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();
 */