力扣面试题 03.02. 栈的最小值双栈

最新推荐文章于 2021-10-09 11:46:38 发布

csu_xiji

最新推荐文章于 2021-10-09 11:46:38 发布

阅读量183

点赞数

分类专栏：力扣思维栈

本文链接：https://blog.csdn.net/xiji333/article/details/107968926

版权

力扣同时被 3 个专栏收录

282 篇文章 2 订阅

订阅专栏

思维

181 篇文章 1 订阅

订阅专栏

栈

36 篇文章 0 订阅

订阅专栏

https://leetcode-cn.com/problems/min-stack-lcci/
在这里插入图片描述
思路：搞个双栈，一个栈就做正常的操作，另外一个栈搞成单调非增的即可。有两种实现方式。

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<int> s;
    //单调非升栈
    stack<int> 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<int> s;
    //单调非升栈
    stack<int> 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();
 */