本文共 1443 字，大约阅读时间需要 4 分钟。

class MinStack {
   public:    /** initialize your data structure here. */    MinStack() {
       }        void push(int x) {
           s.push(x);        if(MIN.empty()||x<=MIN.top())            MIN.push(x);    }        void pop() {
       	//第一种 pop时要判断        if(s.top()==MIN.top())            MIN.pop();        s.pop();    }        int top() {
           return s.top();    }        int getMin() {
           return MIN.top();    }private:    //正常的栈    stack
   
     s;    //单调非升栈    stack
    
      MIN;};/** * 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(); */
    
   

class MinStack {
   public:    /** initialize your data structure here. */    MinStack() {
       }        void push(int x) {
           s.push(x);        if(MIN.empty())            MIN.push(x);        else             MIN.push(min(x,MIN.top()));    }        void pop() {
           s.pop();        MIN.pop();    }        int top() {
           return s.top();    }        int getMin() {
           return MIN.top();    }private:    //正常的栈    stack
   
     s;    //单调非升栈    stack
    
      MIN;};/** * 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(); */
    
   

转载地址：https://blog.csdn.net/xiji333/article/details/107968926 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！