Leetcode 232. 用栈实现队列

0号栈是队列的正序，1号栈是队列的倒序【只有其中一个在使用，用到另一个时需要转换】

class MyQueue {
public:
    /** Initialize your data structure here. */
    stack<int> sta[2];
    int f;
    MyQueue() {
        f=0;
    }

    /** Push element x to the back of queue. */
    void push(int x) {
        if(f) while(!sta[f].empty()) sta[1-f].push(sta[f].top()),sta[f].pop();
        f=0;sta[f].push(x);
    }

    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        if(!f) while(!sta[f].empty()) sta[1-f].push(sta[f].top()),sta[f].pop();
        f=1;
        int x=sta[f].top(); sta[f].pop();
        return x;

    }

    /** Get the front element. */
    int peek() {
        if(!f) while(!sta[f].empty()) sta[1-f].push(sta[f].top()),sta[f].pop();
        f=1;
        return sta[f].top();
    }

    /** Returns whether the queue is empty. */
    bool empty() {
        return sta[f].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();
 */