使用环形数组简单实现队列

主要区别是front和rear从0开始，以前front指向第一个元素的前一个位置，rear指向最后一个元素，现在改成front直接指向头元素

rear指向最后一个元素的下一个位置，队列最后预留出一个约定位置，队列实际使用大小是maxSize-1.

public class CircleArrayQueue {
    public static void main(String[] args) {
        //测试一把
        CircleQueue circleQueue = new CircleQueue(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':
                    circleQueue.showQueue();
                    break;
                case 'a':
                    int value = scanner.nextInt();
                    circleQueue.addQueue(value);
                    break;
                case 'g':
                    try {
                        int result = circleQueue.getQueue();
                        System.out.printf("取出的数据是%d\n", result);
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case 'h':
                    try {
                        int peek = circleQueue.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 CircleQueue{
    private int maxSize; //最大容量
    private int front; //队列头
    private int rear; //队列尾
    private int[] arr; //模拟队列

    public CircleQueue(int maxSize) {
        this.maxSize = maxSize;
        arr=new int[maxSize];
      //默认front和rear从0开始
    }
    //队列是否满
    public boolean isFull() {
        return (rear+1+maxSize)%maxSize==front;
    }
    //队列是否为空
    public boolean isEmpty() {
        return front == rear;
    }
    public void addQueue(int number) {
        boolean full = this.isFull();
        if (full) {
            System.out.println("队列已满，不能加入数据");
            return;
        }
        arr[rear] = number;
        //将rear后移
        rear=(rear+1)%maxSize;
    }

    //获取数据
    public int getQueue() {
        boolean empty = this.isEmpty();
        if (empty) {
            throw new RuntimeException("队列为空！不能获取数据");
        }
        int number = arr[front];
        front=(front+1)%maxSize; //因为是环形要保证是正数
        return number;
    }

    //展示队列所有数据
    public void showQueue() {
        boolean empty = this.isEmpty();
        if (empty) {
            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-front+maxSize)%maxSize;
    }
    //获取队列的头元素
    public int peek() {
        boolean empty = this.isEmpty();
        if (empty) {
            throw new RuntimeException("队列空，无数据");
        }
        return arr[front + 1];
    }
}