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

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

    int pop() {
        int ret=0;
        if(stack2.empty()){
        
            while(!stack1.empty()){
                int top=stack1.top();
                stack1.pop();
                stack2.push(top);
            }
        }
        if(!stack2.empty()){
         ret=stack2.top();
           stack2.pop();
        }

        return ret;
    }

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

空了再搬，而不是连续搬