普通数组模拟队列:
package com.guigu.queue;
import java.util.Scanner;
/**
* @author: guorui fu
* @versiion: 1.0
*/
public class ArrayQueueDemo {
public static void main(String[] args) {
//测试
//先创建一个队列
ArrayQueue arrayQueue = 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): 查看队列头的数据");
System.out.println("====输入对应选项=====");
key = scanner.next().charAt(0);//接收一个字符
switch(key) {
case 's':
arrayQueue.showQueue();
break;
case 'a':
System.out.println("请输入一个数字");
int value = scanner.nextInt();
arrayQueue.addQueue(value);
break;
case 'g'://取出数据
try {
int res = arrayQueue.getQueue();
System.out.println("取出的数据是" + res);
} catch (Exception exception) {
// exception.printStackTrace();
System.out.println(exception.getMessage());
}
break;
case 'h'://查看队列头的数据
try {
int res = arrayQueue.headQueue();
System.out.println("队列头的数据是:" +res);
} catch (Exception exception) {
// exception.printStackTrace();
System.out.println(exception.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) {
this.maxSize = arrMaxSize;
arr = new int[maxSize];
front = -1;//指向队列头部,初始化指向头的前一个位置
rear = -1;//指向队列尾部(对列最后一个数据)
}
//判断队列是否满
public boolean isFull(){
return rear == maxSize -1;
}
//判断队列是否为null
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(){
//判断是否为null
if (isEmpty()){
throw new RuntimeException("队列为null,无数据");
}
front++;//front后移
return arr[front];
}
//显示队列的数据
public void showQueue(){
if (isEmpty()){
System.out.println("队列null,无数据");
return;
}
System.out.println("==数据==");
for (int i = 0; i < arr.length; i++) {
System.out.println(i + "=" + arr[i]);
}
}
//显示队列的头数据,不是取出数据
public int headQueue(){
//判断
if (isEmpty()){
throw new RuntimeException("队列null,无数据");
}
return arr[front + 1];
}
}
使用数组制造环形队列:几个重要设定条件
* front 与 rear 的初始值为0
* (rear + 1) % maxSize == front为数组full
* rear == front 为数组null
* 队列中有效个数 (rear + maxSize - front)%maxSize
package com.guigu.queue;
import java.util.Scanner;
/**
* @author: guorui fu
* @versiion: 1.0
* 环形队列,解决ArrayQueueDemo的队列取出后仍然无法复用的特点
* front 与 rear 的初始值为0
* (rear + 1) % maxSize == front为数组full
* rear == front 为数组null
* 队列中有效个数(rear + maxSize - front)%maxSize
*/
public class CircleArrayQueueDemo {
public static void main(String[] args) {
System.out.println("测试数组 模拟环形数组");
//测试
//先创建一个环形队列
CircleArray circleArray = new CircleArray(4);//最大有效数据为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): 查看队列头的数据");
System.out.println("====输入对应选项=====");
key = scanner.next().charAt(0);//接收一个字符
switch(key) {
case 's':
circleArray.showQueue();
break;
case 'a':
System.out.println("请输入一个数字");
int value = scanner.nextInt();
circleArray.addQueue(value);
break;
case 'g'://取出数据
try {
int res = circleArray.getQueue();
System.out.println("取出的数据是" + res);
} catch (Exception exception) {
// exception.printStackTrace();
System.out.println(exception.getMessage());
}
break;
case 'h'://查看队列头的数据
try {
int res = circleArray.headQueue();
System.out.println("队列头的数据是:" +res);
} catch (Exception exception) {
// exception.printStackTrace();
System.out.println(exception.getMessage());
}
break;
case 'e':
scanner.close();
loop = false;
break;
default:
break;
}
}
System.out.println("程序退出");
}
}
class CircleArray {
private int maxSize;//数组最大容量
private int front;//队列头
private int rear;//队列尾部
private int[] arr;//模拟队列
public CircleArray(int arrMaxSize){
this.maxSize = arrMaxSize;
arr = new int[maxSize];
front = 0;
rear = 0;
}
//判断是否为null
public boolean isEmpty(){
return front == rear;//例:3%3=0
}
//判断队列是否满
public boolean isFull(){
return (rear + 1) % maxSize == front;//例:3%3=0
}
//添加数据到队列
public void addQueue(int n){
//判断队列是否满
if (isFull()){
System.out.println("队列已满,不能继续添加数据。。");
return;
}
arr[rear] = n;
//将rear后移,考虑取模
rear = (rear + 1) % maxSize;
}
//获取队列数据
public int getQueue(){
//判断是否为null
if (isEmpty()){
throw new RuntimeException("队列为null,无数据");
}
//分析front指向第一个元素
//先把front 对应的值保留到一个临时变量
//将front 后移 ,考虑取模
//将临时保存的变量返回
int value = arr[front];
front = (front + 1) % maxSize;
return value;
}
//显示队列的数据
public void showQueue(){
if (isEmpty()){
System.out.println("队列null,无数据");
return;
}
System.out.println("==数据==");
//从front开始遍历,遍历多少个元素
for (int i = front; i < front + size(); i++) {
System.out.println(i % maxSize + "=" + arr[i % maxSize]);
}
}
//当前队列的有效数据个数
public int size(){
//rear = 1 front = 0 maxSize = 3
return (rear + maxSize - front) % maxSize;
}
//显示头元素
public int headQueue(){
//判断
if (isEmpty()){
throw new RuntimeException("队列null,无数据");
}
return arr[front];
}
}