一、结构定义
private static int[] arr=new int[6];//数据
private static int rear =0;//队尾
private static int front =0;//队头
二、判断是否为空
public boolean isEmpty(){
return front==rear;
}
三、判断是否满队
public boolean isFull(){
return (rear+1)%maxSize == front;
}
四、入队
public boolean add(int value){
if(isFull()){
System.out.println("队列已经满");
return false;
}
System.out.println("rear="+rear);
arr[rear]=value;
rear=(rear+1)%maxSize;
return true;
}
五、出队
public int remove(){
if(isEmpty()){
System.out.println("队列为空,返回-1");
return -1;
}
System.out.println("front="+front);
int temp = arr[front];
front=(front+1)%maxSize;
return temp;
}