循环队列

package queue;

import java.util.Scanner;

public class CircleArrayQueue {
    public static void main(String[] args) {
        ArrayQueue arrayQueue = new ArrayQueue(4);
        char key = ' ';//接收用户输入
        Scanner scanner = new Scanner(System.in);
        boolean loop = true;
        while (loop) {
            System.out.println("s:显示队列");
            System.out.println("e:退出程序");
            System.out.println("a:添加数据到队列");
            System.out.println("g:从队列取出数据");
            System.out.println("h:查看队列头的数据");
            key = scanner.next().charAt(0);
            switch (key) {
                case 's':
                    arrayQueue.show();
                    break;
                case 'e':
                    System.out.println("退出程序");
                    loop = false;
                case 'a':
                    System.out.println("输入一个数：");
                    int n = scanner.nextInt();
                    arrayQueue.addqueue(n);
                    break;
                case 'g':
                    int res = arrayQueue.getQueue();
                    System.out.println("取出的数据是:" + res);
                    break;
                case 'h':
                    int headnum = arrayQueue.getFront();
                    System.out.println("队列头数据为:" + headnum);
                    break;
                default:
                    System.out.println("输入有误，请重新输入");
            }
        }
    }
}


class ArrayQueue {
    private int maxsize;//表示数组的最大容量
    private int front;//指向队列头
    private int rear;//指向队列尾的后一个元素
    private int[] arr;//该数组用来模拟队列
    //创建队列的构造器

    public ArrayQueue(int maxsize) {
        this.maxsize = maxsize;
        arr = new int[maxsize];
    }

    //判断队列是否为满
    public boolean isFull() {
        return (rear + 1) % maxsize == front;
    }

    //判断队列是否为空
    public boolean isEmpty() {
        return rear == front;
    }

    //添加数据到对列
    public void addqueue(int n) {
        if (isFull()) {
            System.out.println("队列已满");
        } else {
            arr[rear] = n;
            rear = (rear + 1) % maxsize;
        }
    }

    //获取队列数据
    public int getQueue() {
        if (isEmpty()) {
            throw new RuntimeException("队列中无数据");

        }
        int value = arr[front];
        front = (front + 1) % maxsize;
        return value;
    }

    //打印队列全部数据
    public void show() {
        if (isEmpty()) {
            System.out.println("队列为空");
        }
        for (int i = front; i < front + size(); i++) {
            System.out.printf("arr[%d]=%d\n", i % maxsize, arr[i % maxsize]);
        }
    }

    //求出当前队列有效数据个数
    public int size() {
        return (rear + maxsize - front) % maxsize;
    }

    //显示队列的头数据
    public int getFront() {
        if (isEmpty()) {
            throw new RuntimeException("队列为空，无数据");
        }
        return arr[front + 1];
    }
}