#include <stdio.h> #include <stdlib.h>/************************************************************************/ /* 隊(duì)列結(jié)構(gòu)要素：隊(duì)列容量 內(nèi)存指針 元素個(gè)數(shù) 隊(duì)列頭 對(duì)列尾*/ /************************************************************************/#define QUEUE_CAPACITY 3 //隊(duì)列容量typedef struct tag_queue {int *pQueue; //隊(duì)列內(nèi)存指針int head; //隊(duì)列頭int tail; //隊(duì)列尾int length; //元素個(gè)數(shù) }LineQueue;int InitQueue(LineQueue **myQueue); //InitQueue(&Q) 創(chuàng)建隊(duì)列 void DestroyQueue(LineQueue *myQueue); //DestroyQueue(&Q) 銷毀隊(duì)列 void ClearQueue(LineQueue *myQueue); //已有的元素清空掉 //ClearQueue(&Q) 清空隊(duì)列 int QueueEmpty(LineQueue *myQueue); //QueueEmpty(&Q) 判空隊(duì)列 int QueueFull(LineQueue *myQueue); //QueueFull(&Q) 判滿隊(duì)列 int QueueLength(LineQueue *myQueue); //QueueLength(&Q) 隊(duì)列長(zhǎng)度 int EnQueue(LineQueue *myQueue, int element); //EnQueue(&Q, element) 新元素入隊(duì) int DeQueue(LineQueue *myQueue, int *element); //DeQueue(&Q, &element) 首元素出隊(duì) void QueueTraverse(LineQueue *myQueue); //QueueTraverse(Q, visit()) 遍歷隊(duì)列int InitQueue(LineQueue **myQueue) {(*myQueue) = (LineQueue *)malloc(sizeof(LineQueue));//申請(qǐng)內(nèi)存.強(qiáng)制轉(zhuǎn)換，不然會(huì)為void無(wú)類型。分配結(jié)構(gòu)體內(nèi)存//printf("queue1 = %p\n", (*myQueue));if(myQueue == NULL){return 0;}(*myQueue)->pQueue = (int *)malloc(sizeof(int) * QUEUE_CAPACITY);//分配隊(duì)列內(nèi)存if((*myQueue)->pQueue == NULL){return 0;}(*myQueue)->head = 0;(*myQueue)->tail = 0;(*myQueue)->length = 0;return 1; }void DestroyQueue(LineQueue *myQueue) {free(myQueue->pQueue);myQueue->pQueue = NULL;free(myQueue);myQueue = NULL; }void ClearQueue(LineQueue *myQueue)//把隊(duì)列里面所有的元素刪除掉 {myQueue->length = 0;myQueue->tail = 0; }int QueueEmpty(LineQueue *myQueue) {if(myQueue->length == 0){return 1;}return 0; }int QueueFull(LineQueue *myQueue) {if(myQueue->length >= QUEUE_CAPACITY)//#define QUEUE_CAPACITY 3 //隊(duì)列容量{return 1;}return 0; }int QueueLength(LineQueue *myQueue) {return myQueue->length; }int EnQueue(LineQueue *myQueue, int element) {if(QueueFull(myQueue))//判斷他是否為滿的操作，滿了就不能進(jìn)隊(duì)列了{return 0;}myQueue->pQueue[myQueue->tail] = element;//把元素放入隊(duì)尾myQueue->tail++;//因?yàn)檫M(jìn)隊(duì)列，所以++1myQueue->length++;//大小++1return 1; }int DeQueue(LineQueue *myQueue, int *element)//取出來(lái)，是從head開始取出的啦 {int i = 0;if(QueueEmpty(myQueue)){return 0;}*element = myQueue->pQueue[myQueue->head];for(i = 1; i < myQueue->length; i++){myQueue->pQueue[i-1] = myQueue->pQueue[i];//所有元素往前靠一步}myQueue->length--;//因?yàn)樯倭艘粋€(gè)，所以--myQueue->tail--;//因?yàn)樗性赝耙苿?dòng)一位了，所以--1return 1; }void QueueTraverse(LineQueue *myQueue, int flag) {int i = 0;if(flag == 0) //從頭到尾{for(i = 0; i < myQueue->length; i++){printf("%d ", myQueue->pQueue[i]);}}if(flag == 1) //從尾到頭{for(i = myQueue->length - 1; i >= 0; i--){printf("%d ", myQueue->pQueue[i]);}} }int main(void) {int elem = 0;LineQueue *queue = NULL;InitQueue(&queue);if(QueueEmpty(queue)){printf("當(dāng)前隊(duì)列為空\(chéng)n");}EnQueue(queue, 2);EnQueue(queue, 4);EnQueue(queue, 5);if(QueueFull(queue)){printf("當(dāng)前隊(duì)列為滿\n");}QueueTraverse(queue, 0);printf("\n-----------------------\n");/*DeQueue(queue, &elem);printf("elem = %d\n", elem);DeQueue(queue, &elem);printf("elem = %d\n", elem);DeQueue(queue, &elem);printf("elem = %d\n", elem);*/printf("queueLength = %d\n", QueueLength(queue));ClearQueue(queue);if(QueueEmpty(queue)){printf("當(dāng)前隊(duì)列為空\(chéng)n");}//QueueTraverse(queue, 1);//printf("queue2 = %p\n", queue);DestroyQueue(queue);system("pause");return 0; }

總結(jié)

以上是生活随笔為你收集整理的C语言队列（排队）先进先出.实现全部函数的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

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