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

class Solution
{
public:
    void push(int node) {
        stack1.push(node);
    }

    int pop() {
        if(!stack2.empty()){
            int value=stack2.top();
            stack2.pop();
            return value;
        }
        while(!stack1.empty()){
            int x=stack1.top();
            stack1.pop();
            stack2.push(x);
        }
        int value=stack2.top();
        stack2.pop();
        return value;
    }

private:
    stack<int> stack1;
    stack<int> stack2;
};