public class ArrayQueue {
private int maxSize;//最大容量
private int front;//头指针
private int rear;//尾指针
private int array[];
//创建队列的构造器
public ArrayQueue(int maxSize) {
this.maxSize = maxSize;
array = new int[maxSize];
front = -1;
rear = -1;
}
//判断队列是否已满
public boolean isFull(){
return rear == maxSize-1;
}
//判断队列是否为空
public boolean isEmpty(){
return front == rear;
}
//向队列中添加元素
public void addElement(int num){
if (isFull()){
throw new RuntimeException("队列已满");
}
array[++rear] = num;
}
//数据出队列
public int getElement(){
if (isEmpty()) {
throw new RuntimeException("队列为空");
}
return array[++front];
}
//显示队列中的所有元素
public void show(){
if (isEmpty()){
System.out.println("队列目前为空");
return;
}
for (int i = 0; i < array.length; i++) {
System.out.printf("arr[%d] = %d\n",i,array[i]);
}
}
}
以上代码实现的队列是一个简单实现,没有考虑到动态扩容或缩容的情况。在实际应用中,可能需要根据具体需求对队列进行更加完善的设计和实现