剑指offer之用两个栈实现队列

class Solution
{
public:void push(int node) {while(!stack2.empty()){//satck2有值时，直接压入stack1stack1.push(stack2.top());stack2.pop();}stack1.push(node);}int pop() {while(stack1.size()>1){//栈1出站个数为stack1.size()-1stack2.push(stack1.top()); //将stack2作为缓冲区stack1.pop();}int value=stack1.top();stack1.pop();/*while (!stack1.empty()){stack2.push(stack1.top());stack1.pop();}int value = stack2.top();stack2.pop();*/while(!stack2.empty()){//将stack2中的数据重新压缩stack1stack1.push(stack2.top());stack2.pop();}return value;}private:stack<int> stack1;stack<int> stack2;
};