1.描述
![在这里插入图片描述](https://img-blog.csdnimg.cn/bf7ea642d0c34388bca4f43bf2edecdd.png)
2.代码
package com.atguigu.queue;
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.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.headQueue();
System.out.printf("队列头数据: %d\n",res);
}catch (Exception e){
System.out.println(e.getMessage());
}
break;
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()){
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 headQueue(){
if(isEmpty()){
throw new RuntimeException("队列空,没有数据");
}
return arr[front+1];
}
}