剑指offer9 用两个栈实现队列

    LinkedList<Integer> A;
    LinkedList<Integer> B;
    public CQueue() {
        A=new LinkedList<>();
        B=new LinkedList<>();
    }
    
    public void appendTail(int value) {
        A.addLast(value);
    }
    
    public int deleteHead() {
        if(!B.isEmpty()) return B.removeLast();
        if(A.isEmpty()) return -1;
        while(!A.isEmpty()) B.addLast(A.removeLast());
        return B.removeLast();
    }