使用数组模拟环形队列
- front变量的含义做一个调整,front指向队列的第一个元素,也就是说,arr[front]就是队列的第一个元素。front初始值为0
- rear变量的含义做一个调整,rear指向队列的最后一个元素的后一个位置。因为希望空出一个空间。rear初始值为0
- 队列满的判断:(rear + 1) % maxSize == front
- 队列空的判断:rear == front
- 队列中有效值的个数:(rear - front + maxSize) % maxSize
代码
import java.util.Scanner;
public class CircleQueueDemo {
public static void main(String[] args) {
CircleQueue circleQueue = new CircleQueue(3);
Scanner scanner = new Scanner(System.in);
char key = ' ';
boolean loop = true;
while (loop) {
System.out.println("s(show)");
System.out.println("a(add)");
System.out.println("g(get)");
System.out.println("e(exit)");
System.out.println("h(head)");
key = scanner.next().charAt(0);
switch (key) {
case 's':
circleQueue.showQueue();
break;
case 'a':
System.out.println("请输入一个数");
try {
int temp1 = scanner.nextInt();
circleQueue.addQueue(temp1);
} catch (Exception e) {
e.printStackTrace();
}
break;
case 'g':
try {
System.out.println(circleQueue.getQueue());
} catch (Exception e) {
e.printStackTrace();
}
break;
case 'e':
loop = false;
break;
case 'h':
System.out.println(circleQueue.headQueue());
break;
default:
break;
}
}
System.out.println("退出程序");
}
}
class CircleQueue {
private int maxSize;
private int front;
private int rear;
private int[] arr;
public CircleQueue(int maxSize){
this.maxSize = maxSize;
front = 0;
rear = 0;
arr = new int[maxSize];
}
public boolean isFull(){
return (rear + 1) % maxSize == front;
}
public boolean isEmpty(){
return rear == front;
}
public int size(){
return (rear + maxSize - front) % maxSize;
}
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("队列空");
}
int value = arr[front];
front = (front + 1) % maxSize;
return value;
}
public int headQueue(){
if(isEmpty()){
throw new RuntimeException("队列空");
}
return arr[front];
}
public void showQueue(){
if(isEmpty()){
System.out.println("队列空");
return;
}
for(int i = front; i < front + size(); i++){
System.out.printf("arr[%d] = %d", i%maxSize, arr[i%maxSize]);
System.out.println();
}
}
}