题解 | #两个队列实现栈#

class Solution
{
public:
    void push(int element) {
        queue1.push(element);
        for(int i=1;i<queue1.size();i++){
            queue1.push(queue1.front());
            queue1.pop();
        }
    }

    int pop() {
        int t = queue1.front();
        queue1.pop();
        return t;
    }

    int top() {
       return queue1.front();
    }

    bool empty() {
        return queue1.empty();
    }

private:
    queue<int> queue1;
    queue<int> queue2;
};