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

要求：rt
思路：如果else要重复if的操作那么考虑if的条件和else换一下

class CQueue {
private:
    stack<int> in;
    stack<int> out;
public:
    CQueue() {
        
    }
    
    void appendTail(int value) {
        in.push(value);
    }
    
    int deleteHead() {
        int res=-1;
        if(out.empty()){
            while(!in.empty()){
                out.push(in.top());
                in.pop();
            }
        }
        if(!out.empty()){
            res=out.top();
            out.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();
 */