题解 | 用两个栈实现队列

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

int pop() {
    for (int i = 0; i < stack1.size() - 1; i++)
    {
        stack2.push(stack1.top());
        stack1.pop();
    }
    int current = stack1.top();
    stack1.pop();
    while(!stack2.empty())
    {
        stack1.push(stack2.top());
        stack2.pop();
    }
    return current;
}

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