LeetCode "Implement Stack using Queues"

weixin_30456039

于 2015-06-16 04:35:00 发布

阅读量44

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/tonix/p/4579692.html

本文介绍了如何利用两个队列来实现栈的数据结构，详细解释了push、pop、top和判断空栈的方法。

Two-queue solution

class Stack {
    queue<int> q;
    queue<int> q0;
    int _top;
public:
    // Push element x onto stack.
    void push(int x) {
        q.push(x);
        _top = x;
    }

    // Removes the element on top of the stack.
    void pop() {
        auto len0 = q.size();
        while(--len0)
        {
            q0.push(q.front());
            q.pop();
        }
        q.pop();
        while(!q0.empty())
        {
            q.push(_top = q0.front());
            q0.pop();
        }
    }

    // Get the top element.
    int top() {
        return _top;
    }

    // Return whether the stack is empty.
    bool empty() {
        return q.empty();
    }
};