232 用栈实现队列

栈模拟队列，入队时利用辅助栈将入队元素放在栈底

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