public class CircleArrayQueueDemo {
public static void main(String[] args) {
CircleArray arrayQueue = new CircleArray(4);
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':
arrayQueue.showQueue();
break;
case'a':
System.out.println("请输入一个数字");
int value = scanner.nextInt();
arrayQueue.Add(value);
break;
case 'g':
try{
int res=arrayQueue.getQueue();
System.out.println(res);
}catch (Exception e)
{
System.out.println(e.getMessage());
}
break;
case 'h':
try{
int res=arrayQueue.headQueue();
System.out.println(res);
}catch (Exception e)
{
System.out.println(e.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)
{
maxSize=arrMaxSize;
arr= new int[maxSize];
front=0;//指向队列的第一个元素
rear=0;//指向队列的后一个位置,能够空出一行
}
public boolean isFull(){
return (rear+1)%maxSize==front;
}
public boolean isEmpty(){
return front==rear;
}
public void Add(int n)
{
if(isFull())
{
System.out.println("队列已满,不能加入");
return;
}
arr[rear]=n;
//arr[++rear]=n;
rear=(rear+1)%maxSize;
}
public int getQueue() {
if (isEmpty()) {
throw new RuntimeException("队列为空,不能取出");
}
int value = arr[front];
front=(front+1)%maxSize;
return value;
}
//展示数据
public void showQueue()
{
if(isFull())
{
System.out.println("队列为空,没有数据");
}
for(int i=front;i<front+getMaxSize();i++)
{
System.out.println(arr[i%maxSize]);
}
}
public int getMaxSize(){
return (rear-front+maxSize)%maxSize;//得到该队列的总数
}
public int headQueue()
{
if (isEmpty()){
throw new RuntimeException("队列为空,没有数据");
}
return arr[front];
}
}
循环队列
最新推荐文章于 2024-03-03 22:21:16 发布