数组模拟环形队列

/**
 * 数组模拟环形队列
 */
public class ArrayCircleQueue {

    /**
     * 指向队列第一个元素
     */
    private int front;
    /**
     * 指向队列最后一个元素的下一个位置
     */
    private int rear;

    private int maxSize;

    private int[] arr;


    public ArrayCircleQueue(int arrMaxSize) {
        maxSize = arrMaxSize+1;

        this.front = 0;
        this.rear = 0;
        arr = new int[maxSize];
    }

    //队列是否为空
    public boolean isEmpty() {
        //队列为空的时候 front==rear
        return front == rear;
    }

    //队列是否已满
    public boolean isFull() {
        //头结点和尾结点重合的时候,队列已满
        return (rear + 1) % maxSize == front;
    }

    public void addQueue(int n) {
        if (isFull()) {
            System.out.println("队列已满");
            return;
        }

        arr[rear] = n;
        //rear后移
        rear = (rear + 1) % maxSize;
    }

    public int getQueue() {
        //判断队列是否为空
        if (isEmpty()) {
            throw new RuntimeException("队列为空");
        }
        //先将 front 的值保存到临时变量
        int value = arr[front];
        //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 peekQueue() {
        if (isEmpty()) {
            throw new RuntimeException("数据为空");
        }
        return arr[front];

    }

    public static void main(String[] args) {
        ArrayCircleQueue arrayQueueDemo = new ArrayCircleQueue(3);
        char key = ' ';
        Scanner scanner = new Scanner(System.in);
        boolean flag = true;
        while (flag) {
            System.out.println("s(show): 显示队列");
            System.out.println("e(exit): 退出程序");
            System.out.println("a(add): 添加数字");
            System.out.println("g(get): 获取队列值");
            System.out.println("p(peek): 查看队列头数据");
            key = scanner.next().charAt(0);
            switch (key) {
                case 's':
                    arrayQueueDemo.showQueue();
                    break;
                case 'e':
                    scanner.close();
                    return;

                case 'a':
                    try {
                        System.out.println("请输入一个数");
                        int value = scanner.nextInt();
                        arrayQueueDemo.addQueue(value);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;

                case 'g':
                    try {
                        int res = arrayQueueDemo.getQueue();
                        System.out.println("获取到的数据" + res);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }

                    break;
                case 'p':
                    try {
                        int res = arrayQueueDemo.peekQueue();
                        System.out.println("获取的头部数据" + res);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;

            }


        }
    }

}