队列
数组模拟普通队列
package com.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("程序退出--");
}
}
//使用数组模拟队列,编写一个ArrayQueue类
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++; //rear后移
arr[rear] = n;
}
//出队列
public int getQueue(){
// 判断是否空
if (isEmpty()){
//抛异常处理
throw new RuntimeException("队列空");
}
front++; // 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];
}
}
数组模拟环形队列
package com.queue;
import java.util.Scanner;
public class CircleArrayQueueDemo {
public static void main(String[] args) {
//测试
//创建队列对象
CircleQueue queue = new CircleQueue(4); //设置为4,有效队列为3,arr[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("程序退出--");
}
}
//使用数组模拟队列,编写一个ArrayQueue类
class CircleQueue {
private int maxSize; //最大容量
private int front; //队列头
private int rear;//队列尾部
private int[] arr;//存放数据
//创建队列的构造器
public CircleQueue(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; //rear后移
}
//出队列
public int getQueue(){
//判断是否空
if (isEmpty()){
//抛异常处理
throw new RuntimeException("队列空");
}
//front是指向队列第一个元素
//先把front保存到临时变量,然后后移,返回临时变量
int value =arr[front];
front =(front+1)%maxSize;
return value;
}
//遍历队列
public void showQueue(){
//遍历
if (isEmpty()){
System.out.println("队列空的");
return;
}
//从front开始遍历,遍历有效个数
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 headQueue(){
//判断
if (isEmpty()){
throw new RuntimeException("队列空");
}
return arr[front];
}
}
个人学习笔记,最后求看到的大佬给个赞吧(#^ .^#)!!