剑指Offer09-用两个栈实现队列-cpp

用两个栈实现队列

类似数据结构常考的，用两个栈的栈操作，把入栈顺序a，b，c，d输出为某某，这边模拟队列，就是输出顺序。

实现入队和出队模拟，出队返回队头，为空则返回-1。

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);
    }
    
    int deleteHead() {
        if (stack1.empty() && stack2.empty()) {
            return -1;
        }
        else if (!stack2.empty()) {
            int val = stack2.top();
            stack2.pop();
            return val;
        }
        else {
            while (!stack1.empty()) {
                stack2.push(stack1.top());
                stack1.pop();
            }
            int val = stack2.top();
            stack2.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();
 */