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

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

示例 1：

输入：

["CQueue","appendTail","deleteHead","deleteHead","deleteHead"]

[[],[3],[],[],[]]

输出：[null,null,3,-1,-1]

示例 2：

输入：

["CQueue","deleteHead","appendTail","appendTail","deleteHead","deleteHead"]

[[],[],[5],[2],[],[]]

输出：[null,-1,null,null,5,2]

提示：

• 1 <= values <= 10000

• 最多会对 appendTail、deleteHead 进行 10000 次调用

class CQueue {
private:
    stack<int>s1,s2;
    int res,res1;
public:
    CQueue() {

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

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