文档介绍：/*--Hello,world*/#include""#include""#defineMAXSIZE10typedefintdatatype;typedefstruct{intdata[MAXSIZE];intfront;intrear;}SeqQueue;SeqQueue*InitQueue(){SeqQueue*q;q=(SeqQueue*)malloc(sizeof(SeqQueue));q->front=q->rear=0;returnq;}voidEnQueue(SeqQueue*q,datatypex){if((q->rear+1)%MAXSIZE==q->front)printf("\n顺序循环队列是满的!");else{q->data[q->rear]=x;q->rear=(q->rear+1)%MAXSIZE;}}datatypeDeQueue(SeqQueue*q){datatypex;if(q->front==q->rear){printf("\n顺序队列是空的!不能做删除操作!");return0;}x=q->data[q->front];q->front=(q->front+1)%MAXSIZE;returnx;}intQueueEmpty(SeqQueue*q){return(q->front==q->rear);}intGetHead(SeqQueue*q){inte;if(q->front==q->rear)e=0;elsee=q->data[q->front];returne;}voidYangHui(intn){SeqQueue*q;inti,j,s,t;for(i=1;i<n;i++)printf("");printf("1\n");q=InitQueue();EnQueue(q,0);En