力扣面试题09.两个栈实现队列

1、感觉题目很奇怪

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

class CQueue {
public:
     stack<int> a;
    stack<int> b;
    CQueue() {

    }

    void appendTail(int value) {
        a.push(value);
    }

    int deleteHead() {
        if (b.empty() && a.empty())
            return -1;
        else if (b.empty() && !a.empty())
        {
            while (!a.empty())
            {
                b.push(a.top());
                a.pop();
            }
        }
        int temp = b.top();
         b.pop();
        return temp;     
    }
};

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

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

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

[null,null,3,-1]