我正在尝试实现一个没有count变量的循环数组队列。
我正在寻找一种方法来确定数组是否已满,以便它调用expand方法,但它似乎无法工作,这是为什么?谢谢!
public void enqueue (T element) {
if(front != (rear+1) % queue.length) {
queue[rear] = element;
rear = (rear+1) % queue.length;
}
else
expandCapacity();
}
public void expandCapacity() {
T[] larger = ((T[]) (new Object[queue.length * 2]));
for (int scan=0; scan < queue.length; scan++) {
larger[scan] = queue[front];
front = (front+1) % queue.length;
}
front = 0;
rear = queue.length;
queue = larger;
}发布于 2012-10-16 01:02:35
我发现的第一个错误是,在需要扩展的情况下,您从来没有向队列中添加任何内容!enqueue方法需要如下所示:
public void enqueue(T element) {
if (front == (rear + 1) % queue.length) {
expandCapacity();
}
queue[rear] = element;
rear = (rear + 1) % queue.length;
}此外,在expandCapacity中,您将rear设置为比您应该设置的大1;
rear = queue.length - 1;https://stackoverflow.com/questions/12900044
复制相似问题