栈与队列：栈实现队列

最新推荐文章于 2023-05-20 22:16:29 发布

代码拌饭饭更香

最新推荐文章于 2023-05-20 22:16:29 发布

阅读量58

点赞数

分类专栏：数据结构与算法文章标签：队列栈 stack queue

本文链接：https://blog.csdn.net/cckluv/article/details/113920137

版权

数据结构与算法专栏收录该内容

57 篇文章 2 订阅

订阅专栏

栈与队列：栈实现队列

在这里插入图片描述

class MyQueue {
public:
    stack<int> stIn;
    stack<int> stOut;
    /** Initialize your data structure here. */
    MyQueue() {

    }
    
    /** Push element x to the back of queue. */
    void push(int x) {
        stIn.push(x);
    }
    
    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        while(!stIn.empty())
        {
            int tmp = stIn.top();
            stOut.push(tmp);
            stIn.pop();
        }
        int top = stOut.top();
        stOut.pop();
        while(!stOut.empty())
        {
            stIn.push(stOut.top());
            stOut.pop();
        }
        return top;
    }
    
    /** Get the front element. */
    int peek() {
        while(!stIn.empty())
        {
            int tmp = stIn.top();
            stOut.push(tmp);
            stIn.pop();
        }
        int top = stOut.top();
        while(!stOut.empty())
        {
            stIn.push(stOut.top());
            stOut.pop();
        }
        return top;

    }
    
    /** Returns whether the queue is empty. */
    bool empty() {
        return stOut.empty() && stIn.empty();
    }
};

/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue* obj = new MyQueue();
 * obj->push(x);
 * int param_2 = obj->pop();
 * int param_3 = obj->peek();
 * bool param_4 = obj->empty();
 */