剑指off-用两个栈试下你队列

//两个栈实现一个队列
void cqueue::appendTail(int num)
{
    stack1.push(num);
}
void cqueue::deleteHead()
{
    if (stack2.empty()) {
        while (!stack1.empty()) {
            int temp=stack1.top();
            stack1.pop();
            stack2.push(temp);
        }
       
    }
    if (stack2.size()==0) {
        printf("queue is empty");
    }
    else
     stack2.pop();
}