数组实现循环队列

在该方法中，我们给队列留了一个空余空间，不会使用它，这样方便判断队列空和满的状态，此时当队头（front）==队尾（rear）时，我们认为队列为空，当(rear+1)%maxSize=front时，我们认为队列以满（maxSize为队列长度），这时队列中实际存储的数据数量为队列长度-1

public class CircleArrayQueueDemo {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        CircleArray circleArray = new CircleArray(0);
        while (true){
            System.out.println("1.创建队列");
            System.out.println("2.入队");
            System.out.println("3.出队");
            System.out.println("4.显示队列元素");
            System.out.println("5.退出");
            int select = scanner.nextInt();
            switch (select){
                case 1:
                    System.out.println("请输入队列的长度");
                    int maxSize = scanner.nextInt();
                    circleArray = new CircleArray(maxSize);
                    break;
                case 2:
                    System.out.println("请输入入队元素");
                    int enqueue = scanner.nextInt();
                    circleArray.enqueue(enqueue);
                    break;
                case 3:
                    int dequeue = circleArray.dequeue();
                    if(dequeue != -1)
                        System.out.println("出队成功，结果为"+dequeue);
                    break;
                case 4:
                    circleArray.showQueue();
                    break;
                case 5:
                    System.exit(0);
            }
        }
    }
}
class CircleArray{
    private int maxSize;//队列大小
    private int front;//队列头
    private int rear;//队列尾
    private int[] arr;//队列

    //创建队列
    public CircleArray(int maxSize){
        this.maxSize = maxSize;
        arr = new int[maxSize];
        front = 0;
        rear = 0;
    }
    //判断队列是否为空
    public boolean isEmpty(){
        return rear == front;
    }
    //判断队列是否已满
    public boolean isFull(){
        //此时空了一个位置，没有存数
        return front == (rear+1)%maxSize;
    }
    //入队
    public void enqueue(int enqueue){
        //队列没有满时
        if(isFull()){
            System.out.println("队列已满！！！");
        }else {
            arr[rear] = enqueue;
            rear = (rear+1)%maxSize;
        }
    }
    //出队
    public int dequeue(){
        //队列不为空时
        if (isEmpty()){
            //通过异常抛出
            //throw new RuntimeException("队列空，不能取数据");
            //异常抛出后会自己返回，下面不用在写东西，也不能写东西
            System.out.println("队列为空！！！");
            return -1;
        }else {
            int value = arr[front];
            front = (front + 1) % maxSize;
            return value;

        }
    }
    //求当前队列有效个数
    public int size(){
        if(front == rear){
            return 0;
        }else {
            return (rear + maxSize - front) % maxSize;
        }
    }
    //显示队列中的数据
    public void showQueue(){
        if (isEmpty()){
            System.out.println("队列为空");
        }else {
            System.out.println(front+" "+rear);
            for (int i = front; i < front+size(); i++) {
                System.out.printf("arr[%d]=%d\n",i%maxSize,arr[i%maxSize]);
            }
        }
    }
}