用栈实现队列

以强大回敬热爱

于 2021-08-19 10:38:42 发布

阅读量70

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/qq_51681435/article/details/119796464

版权

数据结构栈队列算法 C++

关键词由CSDN通过智能技术生成

数据结构专栏收录该内容

10 篇文章 0 订阅

订阅专栏

1.用栈实现队列

class MyQueue {
public:
    /** Initialize your data structure here. */
    MyQueue() {

    }
    
    /** Push element x to the back of queue. */
    void push(int x) {
        s1.push(x);

    }
    
    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        if(s2.empty())
        {
            while(!s1.empty())
            {
                s2.push(s1.top());
                s1.pop();
            }
        }
        int a=s2.top();
        s2.pop();
        return a;

    }
    
    /** Get the front element. */
    int peek() {
        if(s2.empty())
        {
            while(!s1.empty())
            {
                s2.push(s1.top());
                s1.pop();
            }
        }
        return s2.top();

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

    }
    stack<int> s1;
    stack<int> s2;
};

/**
 * 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();
 */