学步园

参考自维基百科：

http://zh.wikipedia.org/zh-cn/%E9%98%9F%E5%88%97

含测试代码，详细注释：

#include <QtCore/QCoreApplication><br /> #include <stdio.h><br /> #include <malloc.h></p> <p>/*循环队列 C语言实现<br /> *2011-04-28<br /> *liliming123@sina.com<br /> */</p> <p>#ifndef QElementType<br /> #define QElementType int<br /> #endif</p> <p>#ifndef MAX_SIZE<br /> #define MAX_SIZE 500<br /> #endif</p> <p>typedef struct<br /> {<br /> QElementType *base;//存储数据<br /> int front;//指向队列头<br /> int rear;//指向队列尾<br /> }CirQueue;</p> <p>void InitCirQueue(CirQueue *Q)<br /> {//初始化循环队列<br /> //申请空间<br /> Q->base = (QElementType *)malloc(MAX_SIZE*sizeof(QElementType));<br /> //内存检查<br /> if (!Q->base)<br /> exit(0);<br /> //初始条件，空队列<br /> Q->front = Q->rear = 0;<br /> }</p> <p>void DestroyCirQueue(CirQueue *Q)<br /> {//销毁队列<br /> if (Q->base)<br /> free(Q->base);<br /> Q->base = NULL;<br /> Q->front = Q->rear = 0;<br /> }</p> <p>void ClearCirQueue(CirQueue *Q)<br /> {//清空队列<br /> Q->front = Q->rear = 0;<br /> }</p> <p>bool IsEmptyCirQueue(CirQueue *Q)<br /> {//循环队列是否为空，为空返回true<br /> if (Q->front == Q->rear)<br /> return true;<br /> else<br /> return false;<br /> }</p> <p>int LengthOfCirQueue(CirQueue *Q)<br /> {//获得队列的大小<br /> return (Q->rear - Q->front + MAX_SIZE)%MAX_SIZE;<br /> }</p> <p>bool InsertCirQueue(CirQueue *Q, QElementType e)<br /> {//添加元素到队列，添加成功返回true<br /> //判断队列是否已满<br /> if ((Q->rear+1)%MAX_SIZE == Q->front)<br /> return false;<br /> Q->base[Q->rear] = e;<br /> Q->rear = (Q->rear + 1) % MAX_SIZE;<br /> return true;<br /> }</p> <p>bool DelCirQueue(CirQueue *Q, QElementType *e)<br /> {//删除元素，值保存在e中，删除成功返回true<br /> if (Q->front == Q->rear)<br /> return false;<br /> *e = Q->base[Q->front];<br /> Q->front = (Q->front + 1) % MAX_SIZE;<br /> return true;<br /> }</p> <p>void PrintCirQueue(CirQueue *Q)<br /> {//打印队列<br /> if (IsEmptyCirQueue(Q))<br /> return;<br /> printf("the Queue is:");<br /> int i = Q->front;<br /> while (i != Q->rear)<br /> {<br /> printf("%d ",Q->base[i]);<br /> i = (i+1)%MAX_SIZE;<br /> }<br /> printf("/n");<br /> }</p> <p>int main(int argc, char *argv[])<br /> {<br /> QCoreApplication a(argc, argv);</p> <p> //测试<br /> CirQueue *test;<br /> test = (CirQueue *)malloc(sizeof(CirQueue));<br /> InitCirQueue(test);</p> <p> InsertCirQueue(test, 1);<br /> InsertCirQueue(test, 2);<br /> InsertCirQueue(test, 3);<br /> InsertCirQueue(test, 4);<br /> InsertCirQueue(test, 5);<br /> PrintCirQueue(test);<br /> int temp;<br /> DelCirQueue(test, &temp);<br /> printf("the delete data is : %d/n", temp);<br /> PrintCirQueue(test);</p> <p> free(test);<br /> test = NULL;</p> <p> getchar();<br /> return a.exec();<br /> }<br />