思路分析
- front指向队列的第一个元素,初始值为0
- rear只想队列的最后一个元素的后一个位置(因为希望空出一个空间作为约定),初始值为0
- 队列满的条件是(rear+1)%maxsize==front
- 队列空的条件是rear==front
- 队列中有效的数据个数(rear+maxsize-front)%maxsize
代码实现
package com.algorithm.queue;
import java.util.Scanner;
public class CircleArrayQueue {
public static void main(String[] args) {
//创建一个环形队列
CircleArray queue = new CircleArray(4);//设置4,队列的有效数据最大是3
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':
queue.showQueue();
break;
case 'a':
System.out.println("输出一个数");
int value = scanner.nextInt();
queue.addQueue(value);
break;
case 'g':
try {
int res = queue.outQueue();
System.out.printf("取出的数据是%d\n", res);
} catch (Exception e) {
// TODO: handle exception
System.out.println(e.getMessage());
}
break;
case 'h':
try {
int res = queue.headQueue();
System.out.printf("队列头的数据是%d\n", res);
} catch (Exception e) {
// TODO: handle exception
System.out.println(e.getMessage());
}
break;
case 'e':
scanner.close();
loop = false;
break;
default:
break;
}
}
System.out.println("程序退出");
}
}
class CircleArray{
private int maxSize;
//默认值为0
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 + 1) % maxSize == front;
}
//判断队列是否空
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 outQueue(){
if(isEmpty()){
//通过抛出异常
throw new RuntimeException("队列为空,不能取数据");
}
int value = arr[front];//取出数据
front = (front + 1) % maxSize;//指针后移,要注意取模
return value;
}
//显示队列的所有数据
public void showQueue(){
if(isEmpty()){
System.out.println("队列为空");
}
for (int i = front; i < front + size(); i++) {
System.out.printf("arr[%d]=%d\n",i % maxSize,arr[i % maxSize]);
}
}
//当前队列有效数据个数
public int size(){
return (rear + maxSize - front) % maxSize;
}
//显式队列头数据
public int headQueue(){
if(isEmpty()){
//通过抛出异常
throw new RuntimeException("队列为空,不能取数据");
}
return arr[front];
}
}