sqqueue.cpp#include <stdio.h> #include <malloc.h> #include "sqqueue.h" void InitQueue(SqQueue *&q) //初始化順序環(huán)形隊(duì)列 {q=(SqQueue *)malloc (sizeof(SqQueue));q->front=q->rear=0; } void DestroyQueue(SqQueue *&q) //銷(xiāo)毀順序環(huán)形隊(duì)列 {free(q); } bool QueueEmpty(SqQueue *q) //判斷順序環(huán)形隊(duì)列是否為空 {return(q->front==q->rear); } int QueueLength(SqQueue *q) //返回隊(duì)列中元素個(gè)數(shù)，也稱(chēng)隊(duì)列長(zhǎng)度 {return (q->rear-q->front+MaxSize)%MaxSize; } bool enQueue(SqQueue *&q,ElemType e) //進(jìn)隊(duì) {if ((q->rear+1)%MaxSize==q->front) //隊(duì)滿(mǎn)上溢出return false;q->rear=(q->rear+1)%MaxSize;q->data[q->rear]=e;return true; } bool deQueue(SqQueue *&q,ElemType &e) //出隊(duì) {if (q->front==q->rear) //隊(duì)空下溢出return false;q->front=(q->front+1)%MaxSize;e=q->data[q->front];return true; } sqqueue.h#define MaxSize 5 typedef char ElemType; typedef struct {ElemType data[MaxSize];int front,rear; /*隊(duì)首和隊(duì)尾指針*/ } SqQueue; void InitQueue(SqQueue *&q); //初始化順序環(huán)形隊(duì)列 void DestroyQueue(SqQueue *&q); //銷(xiāo)毀順序環(huán)形隊(duì)列 bool QueueEmpty(SqQueue *q); //判斷順序環(huán)形隊(duì)列是否為空 int QueueLength(SqQueue *q); //返回隊(duì)列中元素個(gè)數(shù)，也稱(chēng)隊(duì)列長(zhǎng)度 bool enQueue(SqQueue *&q,ElemType e); //進(jìn)隊(duì) bool deQueue(SqQueue *&q,ElemType &e); //出隊(duì) main.cpp #include <stdio.h> #include "sqqueue.h" int main() {ElemType e;SqQueue *q;printf("(1)初始化隊(duì)列q\n");InitQueue(q);printf("(2)依次進(jìn)隊(duì)列元素a,b,c\n");if (enQueue(q,'a')==0) printf("隊(duì)滿(mǎn),不能進(jìn)隊(duì)\n");if (enQueue(q,'b')==0) printf("隊(duì)滿(mǎn),不能進(jìn)隊(duì)\n");if (enQueue(q,'c')==0) printf("隊(duì)滿(mǎn),不能進(jìn)隊(duì)\n");printf("(3)隊(duì)列為%s\n",(QueueEmpty(q)?"空":"非空"));if (deQueue(q,e)==0)printf("隊(duì)空,不能出隊(duì)\n");elseprintf("(4)出隊(duì)一個(gè)元素%c\n",e);printf("(5)隊(duì)列q的元素個(gè)數(shù):%d\n",QueueLength(q));printf("(6)依次進(jìn)隊(duì)列元素d,e,f\n");if (enQueue(q,'d')==0) printf("隊(duì)滿(mǎn),不能進(jìn)隊(duì)\n");if (enQueue(q,'e')==0) printf("隊(duì)滿(mǎn),不能進(jìn)隊(duì)\n");if (enQueue(q,'f')==0) printf("隊(duì)滿(mǎn),不能進(jìn)隊(duì)\n");printf("(7)隊(duì)列q的元素個(gè)數(shù):%d\n",QueueLength(q));printf("(8)出隊(duì)列序列:");while (!QueueEmpty(q)){deQueue(q,e);printf("%c ",e);}printf("\n");printf("(9)釋放隊(duì)列\(zhòng)n");DestroyQueue(q);return 0; } 《新程序員》：云原生和全面數(shù)字化實(shí)踐50位技術(shù)專(zhuān)家共同創(chuàng)作，文字、視頻、音頻交互閱讀

總結(jié)

以上是生活随笔為你收集整理的第7周项目实践 1 队列算法库的建立的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。