java - java中队列的链表实现中的大小无法正确计算

Question

我正在尝试用Java实现队列的链表，并且在我的驱动程序中将一些元素出队后，大小没有调整为应有的较小数字。这是代码，输出位于其下方。

这是链表队列的实现:

import java.util.LinkedList;

//implementation of a queue by using a linked list
public class Queue<T> {
    //declaring array list to store and manipulate data 
    //using predefined methods

    private LinkedList<T> list;
    int count, front, rear;

    public Queue() {
        list= new LinkedList<T>();
        count=front=rear=0;
    }

    //Adds given element to rear of queue
    public void enqueue (T element) {
        if(front==rear) {
            list.add(front, element);
            rear++;
        }
        else {
            list.add(rear, element);
            rear++;
        }
        count++;
    }

    //removes element at queue front
    public T dequeue() {
        if(list.isEmpty()) {
            System.out.println("Queue is empty");
            return null;
        }

        T result = list.get(front);
        front++;
        count--;
        return result;
    }

    //returns reference to element at queue front
    public T first() {
        return list.get(front);
    }

    //returns true if queue is empty
    public boolean isEmpty() {
        if(list.isEmpty())
            return true;
        else
            return false;
    }

    //returns number of elements in the queue
    public int size() {
        return list.size();
    }

    //returns string representation of queue
    public String toString() {
        String result = "";
        for(int i=front;i<rear;i++) 
            result+=list.get(i)+" ";
        return result;
    }

}

这是驱动程序类。

/*Demonstrates the use of a queue implemented by
 * using a linked list*/
public class QueueLinkedListDemo {

    public static void main(String[] args) {
        Queue<Character> charList = new Queue<Character>();

//display size of queue
        System.out.println("The size of the queue is " + charList.size());

        //adding elements to queue
        System.out.println("Calling enqueue() to add 'a' to the queue");
        charList.enqueue('a');
        System.out.println("Calling enqueue() to add 'b' to the queue");
        charList.enqueue('b');

        //display size of queue
        System.out.println("The size of the queue is " + charList.size());

        System.out.println("Calling dequeue() method to remove an element from the queue " + charList.dequeue());
        System.out.println("Calling toString() method to display queue elements " + charList.toString());
        //display first element of queue
        System.out.println("The first element in queue is " + charList.first());
        //display size of queue
        System.out.println("The size of the queue is " + charList.size());

    }

}

此代码的输出:队列大小为0调用 enqueue() 将 'a' 添加到队列中调用 enqueue() 将 'b' 添加到队列中队列大小为2调用 dequeue() 方法从队列中删除一个元素调用toString()方法显示队列元素b队列中的第一个元素是 b队列大小为2

请注意，当从队列中删除元素时，大小并未从 2 更改为 1。如何解决这个问题？

Answer 1

你的列表永远不会减少。要纠正此问题，您需要执行以下操作:

    public T dequeue() {
        if(list.isEmpty()) {
            System.out.println("Queue is empty");
            return null;
        }

        T result = list.remove(0);
        return result;
   }

这将使 count、rear、front 变得无用。