225. 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).

方法一：

在c++里，一个vector可以用作一个queue，所以第一种不太符合要求的思路是用vector模拟一个queue。

class MyStack {
public:
    /** Initialize your data structure here. */
    MyStack() {
        
    }
    
    /** Push element x onto stack. */
    void push(int x) {
        queue.push_back(x);
    }
    
    /** Removes the element on top of the stack and returns that element. */
    int pop() {
        int result = top();
        queue.pop_back();
        return result;
    }
    
    /** Get the top element. */
    int top() {
        return queue[queue.size() - 1];
    }
    
    /** Returns whether the stack is empty. */
    bool empty() {
        return queue.size() == 0;
    }
private:
    vector<int> queue;
};

/**
 * Your MyStack object will be instantiated and called as such:
 * MyStack obj = new MyStack();
 * obj.push(x);
 * int param_2 = obj.pop();
 * int param_3 = obj.top();
 * bool param_4 = obj.empty();
 */

这种解法虽然可以AC，但是不符合要求，让我们继续用queue来做。

方法二：

利用两个queue，primaryQueue和helperQueue:

primaryQueue用来保存按照插入元素顺序相反的顺序的元素，

helperQueue用来来回倒。

为了保证逆序，每次插入元素的时候首先将primaryQueue的元素清空，这样pop的时候，会pop除queue的第一个元素，也就是栈顶元素，之前queue的元素书顺序加入到helperQueue里即可。

class MyStack {
public:
    /** Initialize your data structure here. */
    MyStack() {
        
    }
    
    /** Push element x onto stack. */
    void push(int x) {
        if (!empty()) {
            while (!primaryQueue.empty()) {
                helperQueue.push(primaryQueue.front());
                primaryQueue.pop();
            }
            primaryQueue.push(x);
            while (!helperQueue.empty()) {
                primaryQueue.push(helperQueue.front());
                helperQueue.pop();
            }
        } else {
            primaryQueue.push(x);
        }
    }
    
    /** Removes the element on top of the stack and returns that element. */
    int pop() {
        int result = top();
        primaryQueue.pop();
        return result;
    }
    
    /** Get the top element. */
    int top() {
        return primaryQueue.front();
    }
    
    /** Returns whether the stack is empty. */
    bool empty() {
        return primaryQueue.empty();
    }
private:
    queue<int> primaryQueue;
    queue<int> helperQueue;
};

/**
 * Your MyStack object will be instantiated and called as such:
 * MyStack obj = new MyStack();
 * obj.push(x);
 * int param_2 = obj.pop();
 * int param_3 = obj.top();
 * bool param_4 = obj.empty();
 */

必须AC！