力扣-155-最小栈

1、

2、

class MinStack {
public:
    /** initialize your data structure here. */
    MinStack() {
        
    }
    stack<int> minstack;
    stack<int>data;
    void push(int x) {
        data.push(x);
        if(minstack.empty()||x<=minstack.top())//这里忘记等于报错无法执行
        {
            minstack.push(x);
        }
    }
    
    void pop() {
        if(data.top()==minstack.top())//这里如果是最小值被删除则最小栈的栈顶元素也要被删除
        {
            minstack.pop();
        }
        data.pop();
    }
    
    int top() {return data.top();
        
    }
    
    int getMin() {return minstack.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();
 */