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 ptieek operations will be called on an empty queue).

题意：利用栈实现队列。

思路：队列为先进先出线性表，栈为先进后出线性表。利用两个栈(in栈和out栈)实现一个队列。

入队时：元素直接入in栈即可。

出队时：
        若out栈为空，则应该出栈in栈最下面一个，需要将in栈中所有元素取出并放入out栈，再将out栈第一个弹出；
        若out不空时，由上可知，out栈的栈顶元素即为队列的第一个元素。

class MyQueue {
public:
    /** Initialize your data structure here. */
    stack<int>in,out; 
    MyQueue() {
        
    }
    
    /** Push element x to the back of queue. */
    void push(int x) {
        in.push(x);
    }
    
    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        int tmp=peek();
        out.pop();
        return tmp;
    }
    
    /** Get the front element. */
    int peek() {
        if(out.empty()){
            while(!in.empty()){
                out.push(in.top());
                in.pop();
            }
        }
        return out.top();
    }
    
    /** Returns whether the queue is empty. */
    bool empty() {
        if(in.empty()&&out.empty()) 
             return 1;
        else 
             return 0;
    }
};