用数组简单实现队列

public class SpartArray {
    public static void main(String[] args) {
        //测试一把
        ArrayQueue arrayQueue = new ArrayQueue(3);

        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.showQueue();
                    break;
                case 'a':
                    int value = scanner.nextInt();
                    arrayQueue.addQueue(value);
                    break;
                case 'g':
                    try {
                        int result = arrayQueue.getQueue();
                        System.out.printf("取出的数据是%d\n", result);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case 'h':
                    try {
                        int peek = arrayQueue.peek();
                        System.out.printf("头元素是%d\t", peek);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case 'e':
                    scanner.close();
                    loop = false;
                default:
                    break;
            }

        }
        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];
        front = -1; //指向队列头部，分析出front是指向队列头的前一个位置
        rear = -1; //指向队列尾部，直接指向对象尾部(即是队列的最后一个数据)
    }

    //队列是否满
    public boolean isFull() {
        return rear == maxSize - 1;
    }

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

    public void addQueue(int number) {
        boolean full = this.isFull();
        if (full) {
            System.out.println("队列已满，不能加入数据");
            return;
        }
        rear++;
        arr[rear] = number;
    }

    //获取数据
    public int getQueue() {
        boolean empty = this.isEmpty();
        if (empty) {
            throw new RuntimeException("队列为空！不能获取数据");
        }
        front++;
        int number = arr[front];
        return number;
    }

    //展示队列所有数据
    public void showQueue() {
        boolean empty = this.isEmpty();
        if (empty) {
            System.out.println("没有数据");
            return;
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.printf("arr[%d]=%d\n",i,arr[i]);

        }
    }

    //获取队列的头元素
    public int peek() {
        boolean empty = this.isEmpty();
        if (empty) {
            throw new RuntimeException("队列空，无数据");
        }
        return arr[front + 1];
    }
}

这准实现存在一个问题就是add三个后，再get三次，在次添加的时候它会提示队列已满，空间不能循环利用，下次咱们会分享怎么能循环利用。