Java数据结构-队列

/*
队列是一种特殊的线性表，主要用到队首和队尾  front  rear
只允许插如的一端叫做队尾，只允许删除的一端叫做队首
操作有入队：insert  出队：remove 取队首元素；peekFront  判空：isEmpty

*/


public class Queue{
private int front;
private int rear;
private int maxSize;
private int nItems;
private long[] queArray;

public Queue(int s){
if(s<0)
System.out.println("error");
maxSize=s;
front=0;
rear=-1;
nItems=0;
queArray=new long[maxSize];
}

public Queue(){
this(100);
}

public void insert(long j){
if((rear+1)%maxSize!=front){
if(rear==maxSize-1)
rear=-1;
else{
rear++;
queArray[rear]=j
}
nItems++;
}
}

public long remove(){
long tmp=queArray[front];
if(front==maxSize-1)
front=0;
else
front++;
nItems--;
}

public long peekFront(){
return queArray[front];
}

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