leetcode---C++实现---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.

Example:
MyStack stack = new MyStack();

stack.push(1);
stack.push(2);
stack.top(); // returns 2
stack.pop(); // returns 2
stack.empty(); // returns false

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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/implement-stack-using-queues

解题思路

栈的特性是先进后出，而队列的特性是先进先出，为实现栈的特性，需要维护两个队列q1和q2；

1. 向栈中压入元素x时，将数据压入队列q1中；
2. 从栈中弹出栈顶元素时，将队列q1中除最后一个元素外的所有元素都按序存入队列q2中，然后将队列q1中的最后一个元素弹出（保证了栈的后进先出的特性）；此时队列q1为空，所有数据全在队列q2中；然后交换队列q1和q2，此时数据全在队列q1中，队列q2为空；
3. 获取栈中栈顶元素时，与从栈中弹出栈顶元素类似，将队列q1中除最后一个元素外全部存入队列q2中，此时q1中最后一个元素即为栈的栈顶元素。

算法实现（C++）

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

    }
    
    /** Push element x onto stack. */
    void push(int x) {
        m_pushQueue.push(x);
    }
    
    /** Removes the element on top of the stack and returns that element. */
    int pop() {
        int ret = top();
        m_pushQueue.pop();
        m_pushQueue = m_popQueue;
        queue<int> tempQueue;
        m_popQueue.swap(tempQueue);
        return ret;
    }
    
    /** Get the top element. */
    int top() {
        while (m_pushQueue.size() > 1)
        {
            m_popQueue.push(m_pushQueue.front());
            m_pushQueue.pop();
        }
        return m_pushQueue.front();
    }
    
    /** Returns whether the stack is empty. */
    bool empty() {
        return m_pushQueue.empty();
    }

private:
    queue<int>  m_pushQueue;
    queue<int>  m_popQueue;
};

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