java循环队列实现代码

public class Queue {
    //队首指针
    private int front;
    //队尾指针
    private int rear;
    //数组
    private int[] arr;
    //数组最大长度
    private int maxSize;

    //初始化队列长度
    public Queue(int maxSize){
        this.maxSize = maxSize;
        arr = new int[maxSize];
    }

    //是否为空
    public boolean isEmpty(){
        if (front == rear){
            return true;
        }
        else
            return false;
    }

    //是否为满队列
    public boolean isFull(){
        if(front == (rear+1)%maxSize){
            return true;
        }
        else
            return false;
    }

    //计算当前元素个数
    public int queueSize(){
        return (rear + maxSize - front) % maxSize;
    }

    //进队
    public void enQueue(int x){
        //判断是否为满队列
        if(isFull()){
            throw new RuntimeException("队列已满，无法插入新元素");
        }
        arr[rear] = x;
        rear = (rear+1)%maxSize;
    }

    //出队
    public int deQueue(){
        if(isEmpty()){
            throw new RuntimeException("队列为空，无法出队元素");
        }
        int value = arr[front];
        front = (front + 1)%maxSize;
        return value;
    }

    //显示队列里的数据
    public void showQueue(){
        if(isEmpty()){
            System.out.println("队列为空");
            return;
        }
        for (int i = front; i < front + queueSize() ; i++){
            System.out.println("arr[" + i + "] = " + arr[i]);
        }
        return;
    }
}