leetcode_num155_Min Stack

最新推荐文章于 2023-01-19 12:02:28 发布

Sissi_cici

最新推荐文章于 2023-01-19 12:02:28 发布

阅读量729

点赞数

分类专栏： oj-leetcode c++ 文章标签： c++ leetcode data structure

本文链接：https://blog.csdn.net/Eliza1130/article/details/44752701

版权

oj-leetcode 同时被 2 个专栏收录

31 篇文章 0 订阅

订阅专栏

c++

27 篇文章 0 订阅

订阅专栏

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.

class MinStack {
public:
    void push(int x) {
        stack1.push(x);
        if(stack2.empty())
            stack2.push(x);
        else{
            int tmp=stack2.top();
            if(x>tmp)
                stack2.push(tmp);
            else
                stack2.push(x);
        }
    }

    void pop() {
        if((!stack1.empty())&&(!stack2.empty())){
            stack1.pop();
            stack2.pop();
        }
        else
            cout<<"EMPTY!"<<endl;
        
    }

    int top() {
        if(!stack1.empty())
            return stack1.top();
    }

    int getMin() {
        if(!stack2.empty())
            return stack2.top();
        
    }
private:
    stack<int> stack1;
    stack<int> stack2;
};