循环数组实现队列.doc

队列是一种特殊的线性表，特殊之处在于它只允许在表的前端（front）进行删除操作，而在表的后端（rear）进行插入操作，和栈一样，队列是一种操作受限制的线性表。进行插入操作的端称为队尾，进行删除操作的端称为队头。先进先出其有两种存储形式：链式和循环数组存储填写图片摘要（选填）存储结构：循环数组存储结构类：填写图片摘要（选填）相关函数的实现：templateMyQueue:MyQueue()q = new myq;q-ele = new TMax;templateMyQueue:MyQueue()delete q;deleteq-ele;templatevoid MyQueue: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 rear = (q-rear + 1) % Max;q-eleq-rear = t;/coutt入队endl;templateT MyQueue:DeQueue()if (IsEmpty()cout 队空！ head = (q-head + 1) % Max;/ coutheadheadendl;/couteleq-head出队eleq-head;templateint MyQueue:lengthq()return (q-rear - q-head + Max) % Max;可运行程序：#include#define Max 30using namespace std;templatestruct myqint head, rear;T *ele;templateclass MyQueuepublic:MyQueue();MyQueue();void MakeNull(); /将队列置空bool IsEmpty(); /判断是否为空bool IsFull(); /判断是否满void EnQueue(T); /入队T DeQueue(); /出队int lengthq(); /队列的长度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;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 rear = (q-rear + 1) % Max;q-eleq-rear = t;/coutt入队endl;templateT MyQueue:DeQueue()if (IsEmpty()cout 队空！ head = (q-head + 1) % Max;/ coutheadheadendl;/couteleq-head出队eleq-head;templateint MyQueue:lengthq()return (q-rear - q-head + Max) % Max;int main()MyQueue myqueue;myqueue.MakeNull();cout 20个数入队： endl;for (int i = 0; i20; i+)myqueue.EnQueue(i);cout 当前队列长度： myqueue.lengthq() endl;cout 队列出队，输出 endl;for (int i = 0; i20; i+)cout