思路:
1、front:指向队列的第一个元素,即array[front]就是队列的第一个元素,front的初始值是0;
2、rear:指向队列的最后一个元素的后一个位置,空出一个空间做为约定(实际存储数据会比最大容量小1),rear的初始值是0;
3、maxSize:队列的最大容量;
4、队列满的条件是:(rear+1)%maxSize == front ;
5、队列为空的条件:rear == front;
6、队列中的有效数据个数:(rear + maxSize - front)% maxSize
package com.example.demo.sgg.datastructure;
import com.irrigation.icl.exception.ContextRuntimeException;
import java.util.Scanner;
/**
* @Author 木易三水良
* @Date 2019/12/31 11:42
* @description:
*/
public class CircleQueueDemo {
public static void main(String[] args) {
CircleQueue queue = new CircleQueue(4);
/*接收用户输入数据*/
char key = ' ';
Scanner scanner = new Scanner(System.in);
Boolean loop = true;
while (loop) {
System.out.println("s(show):显示队列");
System.out.println("a(add):添加数据");
System.out.println("g(get):获取队列数据");
System.out.println("h(head):显示队列头部数据");
System.out.println("e(exit):退出程序");
key = scanner.next().charAt(0);
switch (key) {
case 's':
try {
queue.showData();
} catch (Exception e) {
System.out.println(e.getMessage());
}
break;
case 'a':
System.out.println("请输入一个数字:");
int value = scanner.nextInt();
try {
queue.addQueue(value);
} catch (Exception e) {
System.out.println(e.getMessage());
}
break;
case 'g':
try {
Integer data = queue.getQueue();
System.out.println("从队列获取的数据为:" + data);
} catch (Exception e) {
System.out.println(e.getMessage());
}
break;
case 'h':
try {
Integer data = queue.headQueue();
System.out.println("队列头部数据为:" + data);
} catch (Exception e) {
System.out.println(e.getMessage());
}
break;
case 'e':
if (scanner != null) {
scanner.close();
}
loop = false;
break;
default:
break;
}
}
System.out.println("程序退出");
}
}
class CircleQueue {
/**
* 队列最大值
*/
private Integer maxSize;
/**
* 指向队列头部第一个元素的位置
*/
private int front;
/**
* 指向队列尾部数据的位置+1
*/
private int rear;
/**
* 队列数值
*/
private Integer[] data;
public CircleQueue(Integer maxSize) {
this.maxSize = maxSize;
data = new Integer[maxSize];
}
/**
* 判断队列是否已满
*/
public Boolean isFull() {
return (rear + 1) % maxSize == front;
}
/**
* 判断队列是否为空
*/
public Boolean isEmpty() {
return rear == front;
}
/**
* 队列添加数据
*
* @param number
*/
public void addQueue(Integer number) {
if (isFull()) {
throw new ContextRuntimeException("队列已满,无法添加数据");
}
data[rear] = number;
rear = (rear + 1) % maxSize;
}
/**
* 从队列获取数据
*/
public Integer getQueue() {
if (isEmpty()) {
throw new ContextRuntimeException("队列为空");
}
/*front后移获取数据*/
Integer datum = data[front];
data[front] = null;
front = (front + 1) % maxSize;
return datum;
}
/**
* 显示队列全部数据
*/
public void showData() {
if (isEmpty()) {
throw new ContextRuntimeException("队列为空");
}
for (int i = 0; i < maxSize; i++) {
System.out.printf("queue[%d] = %d\t", i, data[i]);
}
System.out.println();
}
/**
* 显示队列头部信息
*
* @return
*/
public Integer headQueue() {
if (isEmpty()) {
throw new ContextRuntimeException("队列为空");
}
return data[front];
}
}