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.

Subscribe to see which companies asked this question

class MinStack {
public:
    /** initialize your data structure here. */
    vector<int> data;
    int minn;
    bool flag;
    MinStack() {
        flag = false;
        minn = 0;
    }
    
    void push(int x) {
        data.push_back(x);
        if(data.size()==1) minn = data[0];
        else minn = min(minn, x);
    }
    
    void pop() {
        int temp = data[data.size()-1];
        data.pop_back();
        
        if(temp == minn)
            flag = true;
    }
    
    int top() {
        return data[data.size()-1];
    }
    
    int getMin() {
        if(flag==false) return minn;
        minn=data[0];
        for(int i=1; i < data.size(); i++) {
            if(data[i] < minn)
                minn = data[i];
        }
        flag =false;
        return minn;
    }
};

/**
 * 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();
 */