队列是一个有序列表,可以用数组或者链表来实现, 遵循 先入先出 的原则。
1.用数组模拟队列:
package com.chengliang.queue;
import java.util.Scanner;
//使用数组模拟队列-编写一个ArrayQueue类
class ArrayQueue {
private int maxSize;//表示数组的最大容量
private int front;//队列头
private int rear;//队列尾
private int[] arr;//数据
public ArrayQueue(int arrMaxSize) {
this.maxSize = arrMaxSize;
arr = new int[this.maxSize];
front = -1;//指向队列头的前一个位置
rear = -1;//指向尾部
}
//判断队列是否满
public boolean isFull() {
return this.rear + 1 == maxSize;
}
//判断队列是否为空
public boolean isEmpty() {
return rear == front;
}
//添加数据到队列
public void add(int data) {
//判断队列是否满
if (isFull()) {
System.out.println("队列满");
return;
}
rear++;
arr[rear] = data;
}
//获取队列
public int get() {
if (isEmpty()) {
throw new RuntimeException("队列已空");
}
front++;//后移
return this.arr[front];
}
//显示队列
public void showQueue() {
if (isEmpty()) {
System.out.println("无数据");
return;
}
for (int i = 0; i < this.arr.length; i++) {
System.out.printf("arr[%d]=%d\n", i, this.arr[i]);
}
}
//显示队列的头数据
public int showHead() {
if (isEmpty()) {
throw new RuntimeException("队列已空");
}
return this.arr[front + 1];
}
}
public class ArrayQueueDemo {
public static void main(String[] args) {
ArrayQueue queue = new ArrayQueue(3);
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):查看列头的数据");
int key = scanner.next().charAt(0);//接收一个字符;
switch (key) {
case 's':
queue.showQueue();
break;
case 'a':
System.out.println("请输入一个整数");
int v = scanner.nextInt();
queue.add(v);
break;
case 'g':
try {
int res = queue.get();
System.out.printf("取出的树是%d", res);
} catch (Exception e) {
System.out.println(e.getMessage());
}
break;
case 'h': //查看队列头的数据
try {
int res = queue.showHead();
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("程序退出");
}
}
2.数组模拟环形队列
....还没看懂,等我搞明白再更新哈 ^_^