循环队列进队、出队、浏览.doc

/3、用数组实现整数循环队列，编写进队、出队、浏览队中全部内容的示意程序。#include #define QueueSize 10typedef int DataType;typedef struct int front; int rear; int count; DataType dataQueueSize; CirQueue;/1、置队空void initQueue(CirQueue *Q) Q-front = Q-rear = 0; Q-count = 0;/2、判队空int queueEmpty(CirQueue *Q) return Q-count = 0;/3、判队满int queueFull(CirQueue *Q) return Q-count = QueueSize;/4、入队void enQueue(CirQueue *Q, DataType x) if(queueFull(Q) printf(队满n);return ; Q-count+; Q-dataQ-rear = x; Q-rear = (Q-rear+1)%QueueSize;/5、出队DataType deQueue(CirQueue *Q) DataType temp;if(queueEmpty(Q) printf(队空n);return -1; temp = Q-dataQ-front; Q-count-; Q-front = (Q-front+1)%QueueSize; return temp;/6、访问队头元素DataType queueFront(CirQueue *Q) if(queueEmpty(Q) printf(队空n);return -1; return Q-dataQ-front;void travelQueue(CirQueue *Q) int p = Q-front, k; if(queueEmpty(Q) printf(队空n); for(k = Q-count; k 0; k-) printf(%dn, Q-datap); p = (p+1)%QueueSize; CirQueue queue;void main() DataType b; int ans; while (1) printf(请选择命令!n); printf(t1：建立空队；n); printf(t2：一个指定值进队；n); printf(t3：从队中退出一个队元；n); printf(t4：浏览队中全部内容；n); printf(t其它选择结束程序!n); printf(tt选择？ ); scanf(%d, &ans); if (ans 4) break; if(ans = 2) printf(输入指定值 ); scanf(%d,&b); switch (ans) case 1: initQueue(&queue); break; case 2: enQueue(&queue, b); break; case 3: if(queueEmpty(&queue) printf(队空n); break; b = deQueue(&queue); p