leetcode---C++实现---232. Implement Queue using Stacks（用栈实现队列）

题目

Implement the following operations of a queue using stacks.

• push(x) – Push element x to the back of queue.
• pop() – Removes the element from in front of queue.
• peek() – Get the front element.
• empty() – Return whether the queue is empty.

Example:

MyQueue queue = new MyQueue();

queue.push(1);
queue.push(2);
queue.peek(); // returns 1
queue.pop(); // returns 1
queue.empty(); // returns false

Notes:

You must use only standard operations of a stack – which means only push to top, peek/pop from top, size, and is empty operations are valid.
Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.
You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).

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

解题思路

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

• 向队列中压入元素x时，将x压入栈s1；
• 从队列中弹出top元素时，先判断栈s2是否为空，若为空，则将栈s1中所有元素pop后压入栈s2中，此时s2中元素顺序与入队列的顺序相同，s2的栈顶元素即为最先入队列的元素；若不为空，则栈s2中当前元素的顺序已与入队列的顺序一致，直接弹出栈顶元素即可。
• 获取队列top元素时，与从队列中弹出top元素类似，若s2不为空，则直接取s2的栈顶元素，若s2为空，则把s1中所有元素pop后压入s2中，再取s2的栈顶元素即可。

算法实现（C++）

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

    }
    
    /** Push element x to the back of queue. */
    void push(int x) {
        m_pushStack.push(x);
    }
    
    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        int ret = peek();
        m_popStack.pop();
        return ret;
    }
    
    /** Get the front element. */
    int peek() {
    	if (m_popStack.empty())
    	{
    		while (!m_pushStack.empty())
        	{
            	m_popStack.push(m_pushStack.top());
           	 	m_pushStack.pop();
        	}
    	}
        return m_popStack.top();
    }
    
    /** Returns whether the queue is empty. */
    bool empty() {
        return m_pushStack.empty() && m_popStack.empty();
    }

private:
    stack<int>  m_pushStack;
    stack<int>  m_popStack;
};

/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue* obj = new MyQueue();
 * obj->push(x);
 * int param_2 = obj->pop();
 * int param_3 = obj->peek();
 * bool param_4 = obj->empty();
 */