剑指Offer(9)用两个栈实现队列

class Solution
{
public:
int cou = 0;
void push(int node) {
//存储节点
stack1.push_back(node);
//存储编号
stack2.push_back(cou++);
}

int pop() {
int i = 0;
//如果为-1继续遍历
while(stack2[i] == -1)
{
i++;
}
stack2[i] = -1;
return stack1[i];
}

private:
vector<int> stack1;//存数
vector<int> stack2;//存储编号
};