/* 隊(duì)列是一種操作受限的線性表,其限制為僅允許在表的一端插入,在表的另一端進(jìn)行刪除。 進(jìn)行刪除的一端稱為隊(duì)頭或隊(duì)首,插入元素稱為入隊(duì),刪除元素稱為出隊(duì)。 在順序隊(duì)*q中,隊(duì)空條件為q->front==q->rear。隊(duì)滿條件為q->rear==MaxSize-1. 入隊(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= -1;}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==MaxSize-1) return false; q->rear++; q->data[q->rear]=e; return true;}bool deQueue(SqQueue *&q,ElemType &e)//出隊(duì){ if(q->rear==q->front) return false; q->front++; 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ì)一個元素%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é)果:
新聞熱點(diǎn)
疑難解答