图示思路
![[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-6BFER2uJ-1646878056753)(C:\Users\许正\AppData\Roaming\Typora\typora-user-images\image-20220308192517212.png)]](https://img-blog.csdnimg.cn/4ff1296661bc4fd29c11ad3f8c7fd504.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBA56iL5bqP5ZGY5q2j5q2j,size_20,color_FFFFFF,t_70,g_se,x_16)
代码实现
package com.xz.queue;
import java.util.Scanner;
public class CircleArrayQueueDemo {
public static void main(String[] args) {
CircleArray queue = new CircleArray(4);
char key = ' ';
Scanner scanner = new Scanner(System.in);
boolean loop = true;
while (loop) {
System.out.println("s(show):显示队列");
System.out.println("e(exit):退出程序");
System.out.println("a(add):添加数据到队列");
System.out.println("g(get):从队列取出数据");
System.out.println("h(head):查看队列头的数据");
key = scanner.next().charAt(0);
switch (key) {
case 's':
try {
queue.showQueue();
} catch (Exception e) {
e.getMessage();
}
break;
case 'a':
System.out.println("请输入一个数:");
int i = scanner.nextInt();
queue.addQueue(i);
break;
case 'g':
try {
int res = queue.getQueue();
System.out.println("取出的数据是:" + res);
} catch (Exception e) {
System.out.println(e.getMessage());
}
break;
case 'h':
try {
int res = queue.headQueue();
System.out.println("队列头的数据是:" + res);
} catch (Exception e) {
System.out.println(e.getMessage());
}
break;
case 'e':
scanner.close();
loop = false;
default:
break;
}
}
System.out.println("程序退出~~~");
}
}
class CircleArray {
private int maxSize;
private int front;
private int rear;
private int[] arr;
public CircleArray(int maxSize) {
this.maxSize = maxSize;
arr = new int[maxSize];
}
public boolean isFull() {
return rear == maxSize - 1;
}
public boolean isEmpty() {
return front == rear;
}
public void addQueue(int i) {
if (isFull()) {
System.out.println("队列已满,不能添加数据~");
return;
}
arr[rear] = i;
rear = (rear + 1) % maxSize;
}
public int getQueue() {
if (isEmpty()) {
throw new RuntimeException("队列空,不能取数据~");
}
int value = arr[front];
front = (front + 1) % maxSize;
return value;
}
public void showQueue() {
if (isEmpty()) {
System.out.println("队列为空,不能取数据~~");
return;
}
for (int i = front; i < front + size(); i++) {
System.out.println("arr[" + (i % maxSize) + "] = " + (arr[i % maxSize]) + "\t");
}
}
public int size() {
return (rear + maxSize - front) % maxSize;
}
public int headQueue() {
if (isEmpty()) {
throw new RuntimeException("队列为空!不能查看!");
}
return arr[front];
}
}