实验作业数据结构.pdfVIP

nItems=0;

}

//

publicvoidinsert(intj)//putitematrearofqueue

{

if(rearmaxSize-1)//dealwithwraparound

rear=-1;

queArray[++rear]=j;//incrementrearandinsert

nItems++;//onemoreitem

}

//

publicintremove()//takeitemfromfrontofqueue

{

inttemp=queArray[front++];//getvalueandincrfront

if(frontmaxSize)//dealwithwraparound

front=0;

nItems--;//onelessitem

returntemp;

}

//

publicintpeekFront()//peekatfrontofqueue

{

returnqueArray[front];

}

//

publicbooleanisEmpty()//trueifqueueisempty

{

return(nItems0);

}

//

publicbooleanisFull()//trueifqueueisfull

{

return(nItemsmaxSize);

}

//

publicintsize()//numberofitemsinqueue

{

returnnItems;

}

//

publicQueuemerge(Queueq1,Queueq2,intnum)

{

QueuenewQueue=newQueue(num);

while(!q2.isEmpty())

{

newQueue.insert(q2.remove());

newQueue.insert(q1.remove());

}

while(!q1.isEmpty())

newQueue.insert(q1.remove());

returnnewQueue;

}

publicvoiddisplay()

{

while(!isEmpty())

{//allitems

intn=remove();

System.out.print(n);

System.out.print();

}

System.out.println(OK);

}

//

}//endclassQueue

pub