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

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

示例 1：

输入：
["CQueue","appendTail","deleteHead","deleteHead"]
[[],[3],[],[]]
输出：[null,null,3,-1]
示例 2：

输入：
["CQueue","deleteHead","appendTail","appendTail","deleteHead","deleteHead"]
[[],[],[5],[2],[],[]]
输出：[null,-1,null,null,5,2]

来源：力扣（LeetCode）
 

class CQueue {
public:
    stack<int> data;
    stack<int> temp;
    CQueue() {

    }
    
    void appendTail(int value) {
        int len=(int)data.size();
        int len2 = (int)data.size();
        while(len--){
            temp.push(data.top());
            data.pop();
        }
        data.push(value);
        while(len2--){
            data.push(temp.top());
            temp.pop();
        }
    }
    
    int deleteHead() {
        if(data.empty()){
            return -1;
        }
        int val=data.top();
        data.pop();
        return val;
    }
};

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