队列是一个有序表,遵循先入先出
front指向队列的第一个元素
rear指向队尾元素的后一个位置
初始值 front = rear = 0;
判空front == rear
判满(rear+1)%maxsize==front
队列有效元素的个数(rear + maxsize - front)%maxsize
取元素时,先将队首元素保存在一个变量中,饭后front后移front = (front+!)%maxsize
插入数据:先插入再修改rear的值
arr[rear] = n;
rear = (rear + 1) % maxsize;
package day01;
import java.util.Scanner;
//数组模拟环形队列或者说是循环队列
public class 环形队列 {
public static void main(String[] args) {
// 测试
System.out.println("测试数组模拟环形队列");
circleQueue circleQueue = new circleQueue(3);
String key = "";
Scanner scanner = new Scanner(System.in);
boolean loop = true;
while (loop) {
System.out.println("a--addQueue 添加数据到队列");
System.out.println("g--getQueue 出队列取数据");
System.out.println("s--showQueue 显示当前队列");
System.out.println("h--headQueue 添加数据到队列");
System.out.println("q-- 退出程序");
System.out.println("请输入执行的操作");
key = scanner.nextLine();
switch (key) {
case "a":
System.out.println("请输入数据");
int c = scanner.nextInt();
scanner.nextLine();
circleQueue.addQueue(c);
break;
case "g":
try {
int value = circleQueue.getQueue();
System.out.println("您取出的元素是:" + value);
} catch (Exception e) {
System.out.println(e.getMessage());
}
break;
case "s":
circleQueue.showQueue();
break;
case "h":
circleQueue.headQueue();
break;
case "q":
System.out.println("程序已退出");
loop = false;
default:
break;
}
}
}
}
class circleQueue {
private int maxsize;// 表示数组的最大容量
private int front;// 表示队首,初值为0
private int rear;// 表示队尾,初值为0
private int[] arr;// 数组用于存放数据,模拟队列
public circleQueue(int arrMaxsize) {
maxsize = arrMaxsize;
arr = new int[maxsize];
front = 0;
rear = 0;
}
// 判断队列是否满
public boolean isFull() {
return (rear + 1) % maxsize == front;
}
// 判断队列是否空p
public boolean isEmpty() {
return rear == front;
}
// 添加数据到队列
public void addQueue(int n) {
// 首先判断队列是否满
if (isFull()) {
System.out.println("队列满");
return;
}
// 直接将数据加入
arr[rear] = n;
rear = (rear + 1) % maxsize;
}
// 出队列,取数据
public int getQueue() {
if (isEmpty()) {
throw new RuntimeException("队列为空,不能取出元素");
}
// front指向队列的头部元素,取出元素时,先把该元素保存到一个变量中,front后移
int x = arr[front];
front = (front + 1) % maxsize;
return x;
}
// 返回有效数据的个数
public int size() {
return (rear + maxsize - front) % maxsize;
}
// 显示当前队列的所有数据
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 headQueue() {
if (isEmpty()) {
System.out.println("队列空的,没有数据");
}
return arr[front];
}
}
p