Acwing第20题(用两个栈实现队列)

相关题目：

用两个栈实现队列https://www.acwing.com/problem/content/36/https://www.acwing.com/problem/content/36/

解题思路：

s1作为主栈，s2作为辅助栈，当进行完pop()，peek()等操作时，s2中所有的元素要回到s1中。

相关代码：

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) {
        s1.push(x);
    }
    
    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        while(s1.empty()==false){
            s2.push(s1.top());
            s1.pop();
        }
        int t = s2.top();
        s2.pop();
        while(s2.empty()==false){
            s1.push(s2.top());
            s2.pop();
        }
        return t;
       
    }
    
    /** Get the front element. */
    int peek() {
        while(s1.empty()==false){
            s2.push(s1.top());
            s1.top();
        }
        int t=s1.top();
        while(s2.empty()==false){
            s1.push(s2.top());
            s2.pop();
        }
        return t;
    }
    
    /** Returns whether the queue is empty. */
    bool empty() {
        return s1.empty();
    }
};

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