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

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

    int pop() {
        while(stack1.empty()==0)//empty()判断为空时会返回1，当不返回1时候就执行
        {
            stack2.push(stack1.top());
            stack1.pop();
        }
        int res =stack2.top();
        stack2.pop();
        while(stack2.empty()==0)
        {
            stack1.push(stack2.top());
            stack2.pop();
        }
        return res;
    }

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