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;
    }
}