leetcode刷题日记——Implement Stack using Queues

Implement the following operations of a stack using queues.

push(x) -- Push element x onto stack.
pop() -- Removes the element on top of the stack.
top() -- Get the top element.
empty() -- Return whether the stack is empty.
Notes:
You must use only standard operations of a queue -- which means only push to back, peek/pop from front, size, and is empty operations are valid.
Depending on your language, queue may not be supported natively. You may simulate a queue by using a list or deque (double-ended queue), as long as you use only standard operations of a queue.

You may assume that all operations are valid (for example, no pop or top operations will be called on an empty stack).

问题分析：题目目标是使用队列来实现栈的功能。首先队列是先进先出，栈是后进先出，所以使用一个队列显然是不够的，因此采用二个队列，难点就在于如何用队列模拟出栈，这里使用的办法是将要出栈元素之前的元素先移动到另外一个队列，这样就实现了出栈，同理获取栈顶元素也是一个道理。实现代码如下：

class Stack {
    queue<int> que1;
    queue<int> que2;
public:
    // Push element x onto stack.
    void push(int x) {
        que1.push(x);
    }

    // Removes the element on top of the stack.
    void pop() {
        while(que1.size()>1){
            int element=que1.front();
            que2.push(element);
            que1.pop();
        }
        que1.pop();
        while(que2.size()){
            int element=que2.front();
            que1.push(element);
            que2.pop();
        }
    }

    // Get the top element.
    int top() {
        int x;
         while(que1.size()>1){
            int element=que1.front();
            que2.push(element);
            que1.pop();
        }
        x=que1.front();
        que1.pop();
        que2.push(x);
        while(que2.size()){
            int element=que2.front();
            que1.push(element);
            que2.pop();
        }
        return x;
    }

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

当然还有更加简洁的办法，避免来回的倒队列，就是在增加新元素的时候，将之前的元素重新插入到队列尾部，实现代码如下：

class Stack {
public:
    queue<int> que;
    // Push element x onto stack.
    void push(int x) {
        que.push(x);
        for(int i=0;i<que.size()-1;++i){
            que.push(que.front());
            que.pop();
        }
    }

    // Removes the element on top of the stack.
    void pop() {
        que.pop();
    }

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

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