弗兰西刷题日记-剑指offer-09-两个栈实现队列

import java.util.*;
class CQueue {
    private Stack<Integer> stack1;
    private Stack<Integer> stack2;

    public CQueue() {
        stack1 = new Stack<>();
        stack2 = new Stack<>();
    }
    
    public void appendTail(int value) {
        stack1.add(value);
    }
    
    public int deleteHead() {
        if(stack2.isEmpty()){
            if(!stack1.isEmpty()){
                while(!stack1.isEmpty())
                    stack2.add(stack1.pop());
                return stack2.pop();
            }
            else
                return -1;            
        }
        return stack2.pop();
    }
}

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