java编程 队列_5.1、顺序队列（java实现）

public classSeqQueue {private final int MaxSize = 8;private int rear; //队尾指针

private int front; //队头指针

private int size; //计数器

privateObject seqQueueArray[];/*** 初始化*/

publicSeqQueue() {this.size = 0;this.front = 0;this.rear = 0;

seqQueueArray= newObject[MaxSize];

}public booleanisEmpty(SeqQueue seqQueue) {if (seqQueue.size == 0){return true;

}return false;

}public booleanisFull(SeqQueue seqQueue) {if (seqQueue.size > 0 && seqQueue.rear ==seqQueue.front){return true;

}return false;

}public voidqueueAppend(SeqQueue seqQueue,Object element) {if(isFull(seqQueue)){

System.out.println("已满，无法插入");return;

}

System.out.println(element+"元素入队列");

seqQueue.seqQueueArray[seqQueue.rear]=element;

seqQueue.rear= (seqQueue.rear +1 )%MaxSize;

seqQueue.size++;

}public voidqueueDelete(SeqQueue seqQueue) {if(isEmpty(seqQueue)){

System.out.println("已空，无法出队列");return;

}

System.out.print(seqQueue.seqQueueArray[seqQueue.front]+" ");

seqQueue.front= (seqQueue.front +1)%MaxSize;

seqQueue.size--;

}public voidgetFront(SeqQueue seqQueue) {if(isEmpty(seqQueue)){

System.out.println("已空，无法获取队列头");return;

}

System.out.println("队头元素: "+seqQueue.seqQueueArray[seqQueue.rear]);

}public static voidmain(String[] args) {

SeqQueue seqQueue= newSeqQueue();

seqQueue.getFront(seqQueue);

seqQueue.queueDelete(seqQueue);for (int i = 0; i < 9; i++) {

seqQueue.queueAppend(seqQueue,i);

}

System.out.println("===========");

seqQueue.queueDelete(seqQueue);

System.out.println("===========");int number =seqQueue.size;for (int i = 0; i < number; i++) {

seqQueue.queueDelete(seqQueue);

}

System.out.println();

seqQueue.queueDelete(seqQueue);

}

}