How do I implement a circular queue in Java?

How do I implement a circular queue in Java?

To implement a circular queue in Java, you can use an array and two pointers to track the front and rear of the queue.

Can you show me a sample code for that?

Sure! Here's a simple implementation:

class CircularQueue {
    private int[] queue;
    private int front, rear, size;
    private int capacity;

    public CircularQueue(int capacity) {
        this.capacity = capacity;
        queue = new int[capacity];
        front = size = 0;
        rear = capacity - 1;  
    }

    public boolean enqueue(int item) {
        if (isFull()) return false;
        rear = (rear + 1) % capacity;
        queue[rear] = item;
        size++;
        return true;
    }

    public int dequeue() {
        if (isEmpty()) return -1;
        int item = queue[front];
        front = (front + 1) % capacity;
        size--;
        return item;
    }

    public boolean isFull() {
        return size == capacity;
    }

    public boolean isEmpty() {
        return size == 0;
    }
}

This code defines a circular queue with basic operations.

What are the advantages of using a circular queue?

Circular queues are efficient in utilizing space, as they allow for continuous use of the array without needing to shift elements, which is common in linear queues.