JAVA的队列学习

队列:就是先进先出表
public class sq{
//创建一个数组
private int[] a;
//队列的最大长度
private int maxsize;
//队列的前端
private int front;
//队列的后端
private int rear;
public sq(int size){
maxsize = size;
front = 0;
rear = -1;
item = 0;
}

public void insert(int val){
if(!ifFull()){
if(rear == maxsize -1){
rear = -1;
}
a[++rear] = val;
item++;
}
else{
System.out.println(“队列已满”);
}
}

public int remove(){
int t = null;
if(!isEmpty()){
t = a[front];
a[front++] = null;
if(front == maxsize){
front = 0;
}
item–;
return t;
}
return t;
}

public boolean isFull(){
return (front == maxsize );
}

public boolean isEmpty(){
return (front == 0);
}
}