typedefstructCirleQueue
{
intdata[10];
intfront;
intrear;
}CirleQueue;
voidInitCirQueue(CirleQueueQ)
{
Q.rear=9;
Q.front=9;
}
boolIsFull(CirleQueueQ)
{
if((Q.rear+1)%10==Q.front)
returntrue;
returnfalse;
}
voidEnterCirQueue(CirleQueueQ,intdwValue)
{
boolbRs=IsFull(Q);
if(bRs)
return;
Q.rear=(Q.rear+1)%10;
Q.data[Q.rear]=dwValue;
}
boolIsEmpty(CirleQueueQ)
{
if(Q.rear==Q.front)
returntrue;
returnfalse;
}
intDeCirQueue(CirleQueueQ)
{
if(IsEmpty(Q))
return-1;
Q.front=(Q.front+1)%10;
returnQ.data[Q.front];
}
//GetFront
intGetFront(CirleQueueQ)
{
if(IsEmpty(Q))
return-1;
returnQ.data[(Q.front+1)%10];
}
intmain(intargc,char*argv[])
{
printf("HelloWorld!\n");
return0;
}
赞赏