- 队列是一个有序列表可以用数组或者链表来实现遵循先入先出原则(向队列中插入元素称为入队或者进队;删除元素称为出队或者离队)
- 因为队列的输入,输出是分别从前后端来处理,因此需要两个变量front及rear分别记录队列前后端的下标,front会随着数据输出而改变,而rear则是随着数据输入而改变
![](https://i-blog.csdnimg.cn/blog_migrate/b7bf91bffe3eda0f41687e25ed785e52.png)
队列的常见操作为:
初始化队列:构造一个空队列;
判断队列是否为空,若队列为空返回true,否者返回false;
入队,若队列未满,将值加入队列,并使之成为新的队尾;
出队,若队列非空,删除队头元素;
读队头元素,若队列非空,则将队头元素赋给res返回;
这里使用代码简单实现上述功能:
如下为代码实现1.0⬇️
package com.lmh.sparsearray;
import java.util.Scanner;
public class Queue {
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.showQueue();
break;
case 'a':
System.out.println("输入一个数");
int value = scanner.nextInt();
queue.addQueue(value);
break;
case 'g':
try {
int res = queue.getQueue();
System.out.printf("取出的数据是%d\n"
,res);
}catch (Exception e){
System.out.println(e.getMessage());
}
break;
case 'h':
try {
int res = queue.beadQueue();
System.out.printf("队列头的数据是%d\n"
,res);
break;
}catch (Exception e){
System.out.println(e.getMessage());
}
case 'e':
scanner.close();
loop = false;
break;
default:
break;
}
}
System.out.println("程序退出");
}
}
class ArrayQueue{
private int maxSize;
private int front;
private int rear;
private int[] arr;
public ArrayQueue(int arrMaxSize){
maxSize = arrMaxSize;
arr = new int[maxSize];
front = -1;
rear = -1;
}
public boolean isFull(){
return rear == maxSize -1;
}
public boolean isEmpty(){
return rear == front;
}
public void addQueue(int n){
if (isFull()){
System.out.println("队列满,不能添加数据");
return;
}
rear++;
arr[rear] = n;
}
public int getQueue(){
if (isEmpty()){
System.out.println("队列为空,没有数据");
throw new RuntimeException("队列空,不能取数据");
}
front++;
return arr[front];
}
public void showQueue(){
if (isEmpty()){
System.out.println("队列为空");
return;
}
for (int i = 0; i < arr.length; i++) {
System.out.printf("arr[%d]=%d\n",i,arr[i]);
}
}
public int beadQueue(){
if (isEmpty()){
System.out.println("队列空的,没有数据");
throw new RuntimeException("队列没有数据");
}
return arr[front+1];
}
}
上述代码存在问题,只能用一次,即使取出也无法再次使用,没有达到复用的效果,应使用算法来改进为一个环形队列,可以使用取模来实现:
![](https://i-blog.csdnimg.cn/blog_migrate/9cb2de7eeefc09c1066db2b27e8ea05b.png)
这样一来就将线性的一个首尾未连接的队列连接了起来变成了环形队列:
如下为代码实现2.0
package com.lmh.sparsearray;
import java.util.Scanner;
public class Queue2 {
public static void main(String[] args) {
System.out.println("测试数组模拟环形队列");
ArrayQueue2 queue = new ArrayQueue2(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.showQueue();
break;
case 'a':
System.out.println("输入一个数");
int value = scanner.nextInt();
queue.addQueue(value);
break;
case 'g':
try {
int res = queue.getQueue();
System.out.printf("取出的数据是%d\n",res);
}catch (Exception e){
System.out.println(e.getMessage());
}
break;
case 'h':
try {
int res = queue.beadQueue();
System.out.printf("队列头的数据是%d\n",res);
break;
}catch (Exception e){
System.out.println(e.getMessage());
}
case 'e':
scanner.close();
loop = false;
break;
default:
break;
}
}
System.out.println("程序退出");
}
}
class ArrayQueue2 {
private int maxSize;
private int front;
private int rear;
private int[] arr;
public ArrayQueue2(int arrMaxSize){
maxSize = arrMaxSize;
arr = new int[maxSize];
front = 0;
rear = 0;
}
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 getQueue(){
if (isEmpty()){
System.out.println("队列为空,没有数据");
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.printf("arr[%d]=%d\n",i%maxSize,arr[i%maxSize]);
}
}
public int size(){
return (rear + maxSize - front)%maxSize;
}
public int beadQueue(){
if (isEmpty()){
System.out.println("队列空的,没有数据");
throw new RuntimeException("队列没有数据");
}
return arr[front];
}
}
希望大家批评指正