LeetCode 03.04. 化栈为队

栈：可以处理具有完全包含关系的问题
LeetCode 03.04. 化栈为队
用两个栈实现一个队列（两个栈实现倒序）：

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

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