232 Implement Queue using Stacks

最新推荐文章于 2023-01-14 11:29:42 发布

zhoujun651115

最新推荐文章于 2023-01-14 11:29:42 发布

阅读量190

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/zhoujun651115/article/details/49838553

版权

leetcode 专栏收录该内容

45 篇文章 0 订阅

订阅专栏

class Queue {
public:
    // Push element x to the back of queue.
    void push(int x) {
        s1.push(x);
    }

    // Removes the element from in front of queue.
    void pop(void) {
        if(s2.empty())
        {
            while(!s1.empty())
            {
                s2.push(s1.top());
                s1.pop();
            }
        }
        s2.pop();
    }

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

    // Return whether the queue is empty.
    bool empty(void) {
        return s1.empty()&&s2.empty();
    }
private:
    stack<int > s1;
    stack<int > s2;
};