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

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

Java代码

class CQueue {

    //两个栈，一个出栈，一个入栈
    private Stack<Integer> stack1;
    private Stack<Integer> stack2;

    public CQueue() {
        //栈初始化
        stack1 = new Stack<Integer>();
        stack2 = new Stack<Integer>();
    }
    
    public void appendTail(int value) {
        stack1.push(value);
    }
    
    public int deleteHead() {
        //如果stack2不为空，直接出
        if(!stack2.isEmpty()){
            return stack2.pop();
        }else{
        //否则如果stack1不为空，把入栈中的元素都搬到出栈中 
        //一层While，空间复杂度O(n)
            while(!stack1.isEmpty()){
                stack2.push(stack1.pop());  
            }
            //如果搬完stack1的元素以后出栈还是为空，则没有元素，返回-1。否则返回出栈栈顶元素
            return stack2.isEmpty()? -1:stack2.pop();
        }
    }
}

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