剑指 Offer 09. 用两个栈实现队列

用两个栈实现一个队列。队列的声明如下，请实现它的两个函数 appendTail 和 deleteHead ，分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素，deleteHead 操作返回 -1 )

C++

class CQueue {
    stack<int> stack1,stack2;
public:
    CQueue() {
        //初始化，将两个栈清空
        while(!stack1.empty()){

            stack1.pop();
        }
        while(!stack2.empty()){
            stack2.pop();
        }
    }
    
    void appendTail(int value) {
            stack1.push(value);
            return;
    }
    
    int deleteHead() {
        if(stack2.empty()){
            if(stack1.empty())
            {
                return -1;
            }
            while(!stack1.empty())
            {
                
                stack2.push(stack1.top());
                stack1.pop();
            }
             int res= stack2.top();
             stack2.pop();
             return res;
        }
        else{
             int res= stack2.top();
             stack2.pop();
             return res;

        }

    }
};

/**
 * Your CQueue object will be instantiated and called as such:
 * CQueue* obj = new CQueue();
 * obj->appendTail(value);
 * int param_2 = obj->deleteHead();
 */