用两个栈实现队列

最新推荐文章于 2020-07-23 21:52:11 发布

phoenix_xqq

最新推荐文章于 2020-07-23 21:52:11 发布

阅读量110

点赞数

分类专栏：面试编程题目 LeetCode

本文链接：https://blog.csdn.net/h2498864708/article/details/107482154

版权

面试编程题目同时被 2 个专栏收录

21 篇文章 1 订阅

订阅专栏

LeetCode

17 篇文章 0 订阅

订阅专栏

class CQueue {

    Stack<Integer> stack1;
    Stack<Integer> stack2;

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

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