用栈实现队列

需要用到两个栈，st1用来入队列，st2用来出队列，将元素入栈的方式进入st1后，从st1中不断取栈顶元素再删除，将取道的元素压入st2中，然后出队列时候从st2中取栈顶元素，就可以满足队列的先入先出特性。

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

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