Java数据结构实现一个简单的环形队列

import java.util.Scanner;

public class CircleArrayQueue {
    public static void main(String[] args) {
        System.out.println("输入一个数设置队列的大小：");
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        CircleArray arrayQueue = new CircleArray(n);
        char key = ' ';//接受用户输入
        boolean loop = true;
        while(loop){
            System.out.println("s(show):显示队列");
            System.out.println("e(exit):退出程序");
            System.out.println("a(add):添加数据到队列");
            System.out.println("g(get):从队列中取出数据");
            System.out.println("h(head):查看队列头的数据");
            key = sc.next().charAt(0);//charAt()返回指定位置字符串的字符
            switch (key){
                case's':
                    arrayQueue.showQueue();
                    break;
                case'a':
                    System.out.println("输入一个数：");
                    int value = sc.nextInt();
                    arrayQueue.addQueue(value);
                    break;
                case'g':
                    try {
                        int res = arrayQueue.getQueue();
                        System.out.printf("取出的数据是%d\n",res);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case'h':
                    try {
                        int res = arrayQueue.headQueue();
                        System.out.printf("队列头的数据是：%d\n",res);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                case'e':
                    sc.close();
                    loop = false;
                    break;
                default:
                    break;
            }
        }
        System.out.println("程序退出~");
    }
}


class CircleArray{
    private int maxSize;//表示数组的最大容量
    private int front;//队列头
    private int rear;//队列尾
    private int[] arr;//该数组用于存放数据，模拟队列

    public CircleArray(int arrMaxSize) {
        this.maxSize = arrMaxSize;
        arr = new int[maxSize];
        front = 0;
        rear = 0;
    }
    //判断是否满
    public boolean isFull(){
        return (rear + 1) % maxSize == front;
    }

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

    //添加数据到队列
    public void  addQueue(int n){
        if(isFull()){
            System.out.println("队列满，不能加入数据");
            return;
        }
        //直接将数据加入
        arr[rear] = n;
        //将rear后移，这里必须考虑取模(这样使rear的取值一直在maxsize之内)
        rear = (rear + 1) % maxSize;
    }

    //取出数据
    public int getQueue(){
        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+size(); i++){
            System.out.printf("arr[%d]=%d\n",i %maxSize,arr[i%maxSize]);
        }
    }

    //求出当前队列有效数据个数
    public int size(){

        return (rear + maxSize - front) % maxSize;
    }

    //显示队列的头元素
    public int headQueue(){
        if(isEmpty()){
            throw new RuntimeException("队列为空没有头元素");
        }
        return arr[front];
    }

}