定义
- 队列是一个有序列表,可以用数组或者链表来实现
- 遵循先进先出的原则,即先存入队列的数据,要先取出,后存入的要后取出
数组模拟队列
- 队列本身是有序列表,若使用数组的结构来存储队列的数据,则队列数组的声明如下图,其中maxSize是该队列的最大容量
- 因为队列的输入、输出是分别从前后端来处理,因此需要两个变量front及rear分别记录队列前后端的下标,form会随着数据输出而改变,而rear则是随着数据输入而改变。
- 如图:
![队列及入队出队](https://img-blog.csdnimg.cn/449c3737fd2a451babc668b873818cd8.png)
实现思路:
- 将尾指针往后移,rear+1,front==rear【空】
- 若尾指针rear小于队列的最大下标maxSize-1,则将数据存入rear所指的数组元素中,否则无法存入数据,rear==maxSize-1【队列满】
代码实现:
package com.example.learn.DataStructures.array;
import java.util.Scanner;
public class ArrayQueueDemo {
public static void main(String[] args) {
ArrayQueue queue = new ArrayQueue(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.show();
break;
case 'a':
System.out.println("请输入一个数:");
int num = scanner.nextInt();
queue.addQueue(num);
break;
case 'g':
try {
int result = queue.getQueue();
System.out.printf("取出的数据==%d\n",result);
}catch (Exception e){
System.out.println(e.getMessage());
}
break;
case 'h':
queue.headQueue();
try {
int result = queue.headQueue();;
System.out.printf("head取出的数据==%d\n",result);
}catch (Exception e){
System.out.println(e.getMessage());
}
break;
case 'e':
scanner.close();
break;
default:
break;
}
}
System.out.println("程序退出=====");
}
}
class ArrayQueue{
private int maxSize;
private int front;
private int rear;
private int[] arr;
public ArrayQueue(int QueueSize){
maxSize=QueueSize;
arr=new int[QueueSize];
front=-1;
rear=-1;
}
public boolean isFull(){
return rear==maxSize-1;
}
public boolean IsEmpty(){
return front==rear;
}
public void addQueue(int num){
if(isFull()) {
System.out.println("Queue is full ===");
return;
}
rear++;
arr[rear]=num;
}
public int getQueue(){
if(IsEmpty()) {
throw new RuntimeException("getQueue:Queue is Empty ===");
}
front++;
return arr[front];
}
public void show(){
if(IsEmpty()) {
System.out.println("show:Queue is Empty ===");
}
for (int i=0;i<arr.length;i++) {
System.out.printf("arr[%d]=%d\n",i,arr[i]);
}
}
public int headQueue(){
if(IsEmpty()) {
throw new RuntimeException("headQueue:Queue is Empty ===");
}
return arr[front++];
}
}
存在的问题:数组不能复用!
数组模拟环形队列
实现思路:
- front变量的含义做一个调整:front就指向队列的第一个元素,也就是arr[front]指向队列的第一个元素,front的初始值为0;
- rear变量的含义做一个调整:rear指向队列的最后一个元素的后一个位置,因为希望空出一个空间做为约定,rear的初始值为0;
- 当队列满时,(rear+1)%maxSize==front【满】;
- 当队列为空时,rear==front空。
- 当这样分析后,队列中有效的数据的个数:(rear+maxSize-front)%maxSize
![环形队列](https://img-blog.csdnimg.cn/8b302f6a66dc46c7bc8498284ddc6173.png?x-oss-process=image/watermark,type_ZHJvaWRzYW5zZmFsbGJhY2s,shadow_50,text_Q1NETiBAa2Fpa2FpLnpoYW5n,size_20,color_FFFFFF,t_70,g_se,x_16)
代码实现
package com.example.learn.DataStructures.array.queue;
import java.util.Scanner;
public class CircleArrayQueue {
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':
queue.show();
break;
case 'a':
System.out.println("请输入一个数:");
int num = scanner.nextInt();
queue.addQueue(num);
break;
case 'g':
try {
int result = queue.getQueue();
System.out.printf("取出的数据==%d\n",result);
}catch (Exception e){
System.out.println(e.getMessage());
}
break;
case 'h':
queue.headQueue();
try {
int result = queue.headQueue();;
System.out.printf("head取出的数据==%d\n",result);
}catch (Exception e){
System.out.println(e.getMessage());
}
break;
case 'e':
scanner.close();
break;
default:
break;
}
}
System.out.println("程序退出=====");
}
}
class CircleArray{
private int maxSize;
private int front;
private int rear;
private int[] arr;
public CircleArray(int num){
maxSize=num;
arr=new int[num];
}
public boolean isFull(){
return (rear+1)%maxSize==front;
}
public boolean IsEmpty(){
return front==rear;
}
public void addQueue(int num){
if(isFull()) {
System.out.println("Queue is full ===");
return;
}
arr[rear]=num;
rear=(rear+1)%maxSize;
}
public int getQueue(){
if(IsEmpty()) {
throw new RuntimeException("getQueue:Queue is Empty ===");
}
int value=arr[front];
front=(front+1)%maxSize;
return value;
}
public void show(){
if(IsEmpty()) {
System.out.println("show:Queue is Empty ===");
}
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("headQueue:Queue is Empty ===");
}
return arr[front];
}
}