232. Implement Queue using Stacks

1，题目要求
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.
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).

仅仅用栈（stack），模拟队列（queue）的行为。

2，题目思路
定义两个栈，一个定义为input，一个定义为output，这样就可以将栈进行逆置，也就实现了部分队列的性质。
关于stack：

一开始利用这种办法进行编程时，思路是定义两个栈，只要input栈有元素就将其中的元素push到output中。结果结果是错误的，仔细思考了一下，确实是这样。因为如果只要有元素在input中就将其push，那么整个output栈中元素其实是混乱的，只有连续push的那几个元素才是有序的，其他元素全部都是无序的。
因此，只要当output栈中没有元素之后，才能再将元素push到其中。

3，程序源码

class MyQueue {
public:
    /** Initialize your data structure here. */
    MyQueue() {};
    /** Push element x to the back of queue. */
    void push(int x) {
        input.push(x);
    }

    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        if(output.empty()) trans();     //注意！
        int res = output.top();
        output.pop();
        return res;
    }

    /** Get the front element. */
    int peek() {
        if(output.empty()) trans();     //注意！
        return output.top();
    }

    /** Returns whether the queue is empty. */
    bool empty() {
        return input.empty() && output.empty();     //二栈皆空，说明整个为空
    }

    void trans()
    {
        while(!input.empty())
        {
            output.push(input.top());
            input.pop();
        }
    }

private:
    stack<int> input,output;

};