/*  為了充分使用數(shù)組中的存儲(chǔ)空間，把數(shù)組的首尾相連就成了環(huán)形隊(duì)列  在環(huán)形隊(duì)列*q中，隊(duì)空條件為q->front==q->rear。隊(duì)滿條件為(q->rear +1)%MaxSize == q->front  入隊(duì)操作為先將隊(duì)尾指針增加1，然后把e放在隊(duì)尾。  出隊(duì)操作是先將隊(duì)頭指針增加1，然后取出隊(duì)頭元素。*/#include <stdio.h>#include <stdlib.h>#define MaxSize 5typedef char ElemType;typedef struct{    ElemType data[MaxSize];//存放隊(duì)列中的元素    int front,rear;//隊(duì)頭和隊(duì)尾指針}SQQueue;//定義順序隊(duì)的類型void InitQueue(SqQueue *&q)//初始化順序隊(duì){    q = (SqQueue *)malloc(sizeof(SqQueue));    q->front= q->rear= 0;}void DestroyQueue(SqQueue *&q)//銷毀順序隊(duì){    free(q);}bool QueueEmpty(SqQueue *q)//判斷順序隊(duì)是否為空{(diào)    return (q->front==q->rear);}bool enQueue(SqQueue *&q,ElemType e)//入隊(duì){    if((q->rear +1)%MaxSize == q->front)//隊(duì)滿上溢出        return false;    q->rear = (q->rear + 1)%MaxSize;    q->data[q->rear]=e;    return true;}bool deQueue(SqQueue *&q,ElemType &e)//出隊(duì){    if(q->rear==q->front)//對(duì)空下溢出        return false;    q->front = (q->front + 1)%MaxSize;    e = q->data[q->front];    return true ;}int main(){	ElemType e;	SqQueue *q;	PRintf("環(huán)形隊(duì)列基本運(yùn)算如下:/n");	printf("  (1)初始化隊(duì)列q/n");	InitQueue(q);	printf("  (2)依次進(jìn)隊(duì)列元素a,b,c/n");	if (!enQueue(q,'a')) printf("/t提示:隊(duì)滿,不能進(jìn)隊(duì)/n");	if (!enQueue(q,'b')) printf("/t提示:隊(duì)滿,不能進(jìn)隊(duì)/n");	if (!enQueue(q,'c')) printf("/t提示:隊(duì)滿,不能進(jìn)隊(duì)/n");	printf("  (3)隊(duì)列為%s/n",(QueueEmpty(q)?"空":"非空"));	if (deQueue(q,e)==0)		printf("隊(duì)空,不能出隊(duì)/n");	else		printf("  (4)出隊(duì)一個(gè)元素%c/n",e);	printf("  (5)依次進(jìn)隊(duì)列元素d,e,f/n");	if (!enQueue(q,'d')) printf("/t提示:隊(duì)滿,不能進(jìn)隊(duì)/n");	if (!enQueue(q,'e')) printf("/t提示:隊(duì)滿,不能進(jìn)隊(duì)/n");	if (!enQueue(q,'f')) printf("/t提示:隊(duì)滿,不能進(jìn)隊(duì)/n");	printf("  (6)出隊(duì)列序列:");	while (!QueueEmpty(q))	{	deQueue(q,e);		printf("%c ",e);	}	printf("/n");	printf("  (7)釋放隊(duì)列/n");	DestroyQueue(q);    return 0;}運(yùn)行結(jié)果：