C++——两个栈实现队列操作

class Solution
{
public:
	void push(int node) {
		
		
		while (!stack2.empty())
		{
			stack1.push(stack2.top());
			stack2.pop();
		}
		stack1.push(node);

	}

	int pop() {

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

private:
    stack<int> stack1;//负责push
    stack<int> stack2;//负责pop
};