数据结构 环形队列

数组实现环形队列

front 指向队列的第一个元素,arr[front]就是第一个数据元素  初始值 front=0

rear  指向队列的最后一个元素的后一个位置   就是arr[rear]是空的 , 空出这个空间用来做约定 初始值 rear=0

队列满条件 :   (rear+1)%maxSize == front

队列空条件  rear == front;

队列中有效数据个数   (rear+maxSzie-front)%maxSize    // rear = 0,front=1    5

import java.util.Scanner;

public class CirArrQueueDemo {
    public static void main(String[] args) {
        CAQueue queue = new CAQueue(4);//最大有效空间3
        char key = ' ';
        Scanner sc = new Scanner(System.in);
        boolean loop = true;
        //输出菜单
        while (loop) {
            System.out.println("s:显示队列 ");
            System.out.println("a:添加数据 ");
            System.out.println("g:删除数据 ");
            System.out.println("h:头数据 ");
            System.out.println("e:退出程序 ");
            System.out.println("请选择: ");
            key = sc.next().charAt(0);
            switch (key) {
                case 'a':
                    System.out.print("请输入一个数  ");
                    int num = sc.nextInt();
                    queue.addQueue(num);
                    break;
                case 'g':
                    try {
                        int res = queue.getQueue();
                        System.out.printf("取出的数据为%d", res);
                        System.out.println();
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case 's':
                    queue.showQueue();
                    break;
                case 'h':
                    try {
                        int res = queue.headQueue();
                        ;
                        System.out.printf("现在的头数据为%d", res);
                        System.out.println();
                    } catch (Exception e) {
                        System.out.println(e.getMessage());
                    }
                    break;
                case 'e':
                    loop = false;
                    break;
                default:
                    break;
            }
        }
        System.out.println("程序退出");
    }
}

//使用数组模拟队列
class CAQueue {
    private int maxSize;
    private int front;
    private int rear;
    private int[] arr;

    //创建队列的构造器
    public CAQueue(int arrMaxSize) {
        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 num) {
        if (isFull()) {
            System.out.println("Queue is full,can't add anymore");
            return;//退出类
        }
        arr[rear] = num;//直接添加数据
        rear = (rear + 1) % maxSize;//rear后移
    }

    //取出数据
    public int getQueue() {
        if (isEmpty()) {
            //抛出异常
            throw new RuntimeException("Queue is empty,can't get anymore");
            //隐藏了return
        }
        //front 就是指向第一个元素
        //先把front保存在临时变量里,front后移   再返回临时变量
        int value = arr[front];
        front = (front + 1) % maxSize;
        return value;
    }

    //显示队列所有数据
    public void showQueue() {
        //遍历队列
        if (isEmpty()) {
            System.out.println("Queue is empty");
            return;
        }
        for (int i = front; i < front + size(); i++) {
            //如果是i 下标会超出 循环
            System.out.printf("arr[%d]=%d", i % maxSize, arr[i % maxSize]);
            System.out.println();
        }
    }

    public int size() {
        //有效数据个数
        return (rear + maxSize - front) % maxSize;
    }

    //显示队列 头数据
    public int headQueue() {
        if (isEmpty()) {
            //抛出异常
            throw new RuntimeException("Queue is empty,can't get anymore"); 
            //隐藏了return
        }
        return arr[front];
    }
}