循環(huán)數(shù)組實(shí)現(xiàn)隊(duì)列

1、隊(duì)列是一種特殊的線性表，特殊之處在于它只允許在表的前端（front）進(jìn)行刪除操作，而在表的后端（rear）進(jìn)行插入操作，和棧一樣，隊(duì)列是一種操作受限制的線性表。進(jìn)行插入操作的端稱為隊(duì)尾，進(jìn)行刪除操作的端稱為隊(duì)頭。先進(jìn)先出其有兩種存儲(chǔ)形式：鏈?zhǔn)胶脱h(huán)數(shù)組存儲(chǔ)填寫圖片摘要（選填）存儲(chǔ)結(jié)構(gòu)：循環(huán)數(shù)組存儲(chǔ)結(jié)構(gòu)類：填寫圖片摘要（選填）相關(guān)函數(shù)的實(shí)現(xiàn)：templateMyQueue:MyQueue()q = new myq;q->ele = new TMax;templateMyQueue:MyQueue()delete q;deleteq->ele;templatevoid MyQueue:

2、MakeNull()q->head = q->rear = 0;templatebool MyQueue:IsEmpty()if (q->rear = q->head)return true;elsereturn false;templatebool MyQueue:IsFull()if (q->rear + 1) % Max = q->head)return true;elsereturn false;templatevoid MyQueue:EnQueue(T t)if (IsFull()cout << "隊(duì)滿"elseq

3、->rear = (q->rear + 1) % Max;q->eleq->rear = t;/cout<<t<<"入隊(duì)"<<endl;templateT MyQueue:DeQueue()if (IsEmpty()cout << "隊(duì)空！" << endl;return NULL;else q->head = (q->head + 1) % Max;/ cout<<q->head<<"head"<<

4、;endl;/cout<<q->eleq->head<<"出隊(duì)"<<endl;return q->eleq->head;templateint MyQueue:lengthq()return  (q->rear - q->head + Max) % Max;可運(yùn)行程序：#include#define Max 30using namespace std;templatestruct myqint head, rear;T *ele;templateclass MyQueuepublic:MyQu

5、eue();MyQueue();void MakeNull();            /將隊(duì)列置空bool IsEmpty();             /判斷是否為空bool IsFull();              /判斷是否滿void EnQueue(T);            /入隊(duì)T DeQueue();    

6、;            /出隊(duì)int lengthq();               /隊(duì)列的長(zhǎng)度private:myq *q;templateMyQueue:MyQueue()q = new myq;q->ele = new TMax;templateMyQueue:MyQueue()delete q;deleteq->ele;templatevoid MyQueue:MakeNull()q->head = q->rear = 0;te

7、mplatebool MyQueue:IsEmpty()if (q->rear = q->head)return true;elsereturn false;templatebool MyQueue:IsFull()if (q->rear + 1) % Max = q->head)return true;elsereturn false;templatevoid MyQueue:EnQueue(T t)if (IsFull()cout << "隊(duì)滿"elseq->rear = (q->rear + 1) % Max;q->

8、;eleq->rear = t;/cout<<t<<"入隊(duì)"<<endl;templateT MyQueue:DeQueue()if (IsEmpty()cout << "隊(duì)空！" << endl;return NULL;else q->head = (q->head + 1) % Max;/ cout<<q->head<<"head"<<endl;/cout<<q->eleq->head&l

9、t;<"出隊(duì)"<<endl;return q->eleq->head;templateint MyQueue:lengthq()return  (q->rear - q->head + Max) % Max;int main()MyQueue myqueue;myqueue.MakeNull();cout << "20個(gè)數(shù)入隊(duì)：" << endl;for (int i = 0; i<20; i+)myqueue.EnQueue(i);cout << "當(dāng)前隊(duì)列長(zhǎng)度：" << myqueue.lengthq() << endl;cout << "隊(duì)列出隊(duì)，輸出" << end