队列的循环数组实现
class CircleArray{
private int maxSize;
private int front;
private int rear;
private int[] arr;
public CircleArray(int arrMaxSize){
maxSize = arrMaxSize;
arr = new int[maxSize];
}
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;
}
public int getQueue(){
if(isEmpty()){
throw new RuntimeException("队列空,不能取数据");
}
int value =arr[front];
front=(front+1)%maxSize;
return value;
}
public int size(){
return (rear+maxSize-front)%maxSize;
}
public void showQueue(){
if(isEmpty()){
System.out.println("队列空,没有数据");
return;
}
for(int i=front; i<front+size();i++){
System.out.printf("arr[%d]=%d\n",i%maxSize,arr[i%maxSize]);
}
}
public int headQueue(){
if(isEmpty()){
throw new RuntimeException("队列空的,没有数据");
}
return arr[front];
}
}