package com.dhu.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[arrMaxSIze];
front = -1; //指向队列头部,front是指向队列头的前一个位置
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++; //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];
}
}
数据结构--队列(1)
于 2024-04-03 21:52:14 首次发布