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

class Solution
{
public:
    void push(int node) {
        stack1.push(node);
       
    }
    int pop() {
        if(stack2.empty())
        {
            while(!stack1.empty())               //将栈1的元素全部入栈2
            {
                stack2.push(stack1.top());
                stack1.pop();
            }

        }
        int tmp=stack2.top();              //将栈2元素出栈
        stack2.pop();
        return tmp;
    }

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