循環隊列的使用

循環隊列順序存儲結構

#define MAXSIZE 100 typedef int QElemType; typedef struct SqQueue{QElemType data[MAXSIZE];int front;/*指向隊列頭*/int rear;/*指向隊列尾*/ };

?循環隊列為空的判斷：Q->front == Q->rear

循環隊列隊滿的判斷：(Q->rear + 1) % MAXSIZE == Q->front

隊滿入下圖所示：

計算隊列長度公式：(rear-front+QueueSize)%QueueSize

?

#include<iostream> using namespace std; #define MAXSIZE 100 typedef int QElemType; typedef struct SqQueue{QElemType data[MAXSIZE];int front;/*指向隊列頭*/int rear;/*指向隊列尾*/ }; /*初始化隊列*/ void InitQueue(SqQueue *Q){Q->front = 0;Q->rear = 0; } /*求隊列長度*/ int QueueLength(SqQueue Q){return (Q.rear - Q.front + MAXSIZE) % MAXSIZE; } /*入隊操作*/ void EnQueue(SqQueue *Q, QElemType e){if ((Q->rear + 1) % MAXSIZE == Q->front){cout << "該隊列已滿" << endl;return;}Q->data[Q->rear] = e;Q->rear = (Q->rear + 1) % MAXSIZE; } /*出隊操作*/ void DeQueue(SqQueue *Q){if (Q->front == Q->rear){cout << "該對列已空" << endl;return;}cout << Q->data[Q->front] << endl;Q->front = (Q->front + 1) % MAXSIZE; }int main(){SqQueue Q;InitQueue(&Q);EnQueue(&Q, 3);EnQueue(&Q, 2);EnQueue(&Q, 3);EnQueue(&Q, 4);EnQueue(&Q, 5);DeQueue(&Q);DeQueue(&Q);DeQueue(&Q);DeQueue(&Q);cout << QueueLength(Q) << endl; }

?附：隊列的鏈式存儲結構代碼示例：

#include<iostream> using namespace std;typedef int QElemType;typedef struct QNode{QElemType data;struct QNode *next; }; typedef struct LinkQueue{QNode * front, *rear; }; /*初始化隊列*/ void InitQueue(LinkQueue *Q){QNode *q = new QNode;q->data = 0;q->next = NULL;Q->front = q;Q->rear = q; } /*入隊*/ void EnQueue(LinkQueue *Q, QElemType e){QNode *p = new QNode; p->data = e;p->next = NULL;Q->rear->next = p; //隊列頭指針指向空節點Q->rear = p; } /*出隊*/ void DeQueue(LinkQueue *Q){QNode *p;if (Q->front == Q->rear){cout << "該隊列已空" << endl;return;}p = Q->front->next;cout << p->data<<endl;Q->front->next = p->next;if (Q->rear == p){Q->rear = Q->front;}free(p); }int main(){LinkQueue Q;InitQueue(&Q);EnQueue(&Q, 1);EnQueue(&Q, 2);EnQueue(&Q, 3);EnQueue(&Q, 4);EnQueue(&Q, 5);DeQueue(&Q);DeQueue(&Q);DeQueue(&Q);DeQueue(&Q); }

?

轉載于:https://www.cnblogs.com/EmperLin/p/6550572.html

總結

以上是生活随笔為你收集整理的数据结构(8)----栈与队列之循环队列的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。