leetcode/lcof/9/

[giscus[bot]]

leetcode/lcof/9/

多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解

https://doocs.github.io/leetcode/lcof/9/

[FancyShawn]

方法二：数组+双指针

class CQueue {

    private int[] queue;
    private int head;
    private int tail;
    private int capacity;

    public CQueue() {
        capacity = 10000;
        queue = new int[capacity];
        tail = 1;
        head = 0;
    }
    
    public void appendTail(int value) {
        queue[((tail++ - 1) % capacity)] = value;
    }
    
    public int deleteHead() {
        if ((head + 1 % capacity) == tail) return -1;
        return queue[head++ % capacity];
    }
}

[FancyShawn]

方法一也太奇怪了，都用上Deque了，不直接就是双向队列了吗

[yanglbme]

感谢提供方法二，Java 里面一般推荐用 Deque 充当 Stack