02java算法与数据结构------队列用数组代码实现

import java.util.Scanner;

public class Test {
    static int rear;
    static int front;
    static int maxSize;

    public static void main(String[] args) {
        //队列用数组来实现
        Scanner sc = new Scanner(System.in);
        System.out.println("请你输入队列的最大值");
        maxSize = sc.nextInt();
        int[] arr = new int[maxSize];
        //队列的尾;
        rear = -1;
        //队列的头;
        front = -1;
        //队列用数组来实现 ---给数组添加值
        while (true) {
            System.out.println("请你添加数组的值");
            int count = sc.nextInt();
            rear++;
            arr[rear] = count;
            if (getfull()) {
                System.out.println("请你添加数组的值已经满了");
                break;
            }
        }
        //队列用数组来实现 ---给数组添加值-----遍历
        for (int i = 0; i < arr.length; i++) {
            if (getempty()) {
                System.out.println("该数组为空");
                break;
            }
            System.out.println(arr[i]);
        }
    }

    public static boolean getfull() {
        return rear == maxSize - 1;
    }

    public static boolean getempty() {
        return rear == front;
    }
}