剑指offer -- 用两个栈实现队列

leetcode链接：https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/

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

示例 1：

输入：
["CQueue","appendTail","deleteHead","deleteHead"]
[[],[3],[],[]]
输出：[null,null,3,-1]

示例 2：

输入：
["CQueue","deleteHead","appendTail","appendTail","deleteHead","deleteHead"]
[[],[],[5],[2],[],[]]
输出：[null,-1,null,null,5,2]

解题思路：将两个栈分为入队栈和出队栈，入队时，压入入队栈，并将队列中元素个数增加1，出队时，若队列中无元素，返回-1，若出队栈为空，则依次将入队栈出栈后压入出队栈，弹出出队栈栈顶元素即可，将队列中元素个数减1.

class CQueue {
    Stack<Integer> stack1 ;
    Stack<Integer> stack2 ;
    int size;
    public CQueue() {
        stack1 =  new Stack<Integer>();
        stack2 =  new Stack<Integer>();
        size = 0;
    }
    
    public void appendTail(int value) {
        stack1.push(value);
        size++;
    }
    
    public int deleteHead() {
        if(size <1){
            return -1;
        }else if(stack2.isEmpty()){
            while(!stack1.isEmpty()){
                stack2.push(stack1.pop());
            }
        }
        size--;
        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();
 */