順序隊(duì)列是隊(duì)列的順序存儲(chǔ)結(jié)構(gòu)，順序隊(duì)列實(shí)際上是運(yùn)算受限的順序表。和順序表一樣，順序隊(duì)列用一個(gè)向量空間來存放當(dāng)前隊(duì)列中的元素。由于隊(duì)列的隊(duì)頭和隊(duì)尾的位置是變化的，設(shè)置兩個(gè)指針front和rear分別指示隊(duì)頭元素和隊(duì)尾元素在向量空間中的位置，它們的初值在隊(duì)列初始化時(shí)均應(yīng)設(shè)置為0。
頭文件 SqQueue.h

#ifndef _SQUEUE_H__ #define _SQUEUE_H__ #include "error.h"#define TRUE 1 #define FALSE 0#define SIZE 10 typedef int QueueData; typedef struct _queue {QueueData data[SIZE];int front; // 指向隊(duì)頭的下標(biāo)int rear; // 指向隊(duì)尾的下標(biāo) }Queue;// 置空隊(duì) int InitQueue (Queue* q);// 判隊(duì)空否 int QueueEmpty (Queue* q);// 判隊(duì)滿否 int QueueFull (Queue* Q);// 進(jìn)隊(duì) int EnQueue (Queue* q, QueueData x);// 出隊(duì) int DeQueue (Queue* s, QueueData *x);// 取隊(duì)頭 int GetFront (Queue* s, QueueData *x);#endif // _SQUEUE_H__

源文件 ：SqQueue.c

#include "SqQueue.h"// 置空隊(duì) int InitQueue (Queue* q) {if (NULL == q){errno = ERROR;return FALSE;}// 置空隊(duì)q->front = 0;q->rear = 0;return TRUE; }// 判隊(duì)空否 int QueueEmpty (Queue* q) {if (NULL == q){errno = ERROR;return FALSE;}return (q->front == q->rear); }// 判隊(duì)滿否 int QueueFull (Queue* q) {if (NULL == q){errno = ERROR;return FALSE;}return (q->front == (q->rear+1) % SIZE); }// 進(jìn)隊(duì) int EnQueue (Queue* q, QueueData x) {if (NULL == q){errno = ERROR;return FALSE;}if (QueueFull(q)){errno = FULL_QUEUE;return FALSE;}q->data[(++q->rear) % SIZE] = x;return TRUE; }// 出隊(duì) int DeQueue (Queue* q, QueueData *x) {if (NULL == q){errno = ERROR;return FALSE;}if (QueueEmpty(q)){errno = EMPTY_QUEUE;return FALSE;}*x = q->data[(++q->front) % SIZE];return TRUE; }// 取隊(duì)頭 int GetFrontf (Queue* q, QueueData *x) {if (NULL == q){errno = ERROR;return FALSE;}if (QueueEmpty(q)){errno = EMPTY_QUEUE;return FALSE;}*x = q->data[(q->front + 1) % SIZE];return TRUE; }

鏈?zhǔn)疥?duì)列 鏈?zhǔn)疥?duì)列沒有空間溢出的問題
頭文件 LinkQueue.h

#ifndef __LINKQUEUE_H__ #define __LINKQUEUE_H__ #include "error.h"#define TRUE 1 #define FALSE 0typedef int QueueData; typedef struct _node {QueueData data;struct _node* next; }Node;typedef struct _queue {Node* front;Node* rear; }Queue;// 創(chuàng)建隊(duì)列 Queue* Create_Queue ();// 置空隊(duì)列 int QueueEmpty (Queue* q);// 進(jìn)隊(duì) int EnQueue (Queue* q, QueueData x);// 出隊(duì) int DeQueue (Queue* q, QueueData *x);// 取隊(duì)頭 int GetFront (Queue* q, QueueData *x);// 銷毀隊(duì)列 int Destroy_Queue (Queue *q);#endif

源文件 LinkQueue.c

#include "LinkQueue.h" #include <stdlib.h>// 創(chuàng)建隊(duì)列 Queue* Create_Queue () {Queue* q = (Queue*) malloc(sizeof(Queue)/sizeof(char));if (NULL == q){errno = MALLOC_ERROR;return NULL;}// 置空隊(duì)q->front = NULL;q->rear = NULL;return q; }// 置空隊(duì) int QueueEmpty (Queue* q) {if (NULL == q){errno = ERROR;return FALSE;}return q->front == NULL; }// 進(jìn)隊(duì) int EnQueue (Queue* q, QueueData x) {if (NULL == q){errno = ERROR;return FALSE;}Node* node = (Node*) malloc(sizeof(Node)/sizeof(char));if (NULL == node){errno = MALLOC_ERROR;return FALSE;}node->data = x;node->next = NULL;if (NULL == q->front){q->front = node;q->rear = node;}else {q->rear->next = node;q->rear = node;}return TRUE; }// 出隊(duì) int DeQueue (Queue* q, QueueData *x) {if (NULL == q){errno = ERROR;return FALSE;}if (QueueEmpty(q)){errno = EMPTY_QUEUE;return FALSE;}Node* p = q->front;*x = p->data;q->front = p->next;free(p);if (NULL == q->front){q->rear = NULL;}return TRUE;}// 取隊(duì)頭 int GetFront (Queue* q, QueueData *x) {if (NULL == q){errno = ERROR;return FALSE;}if (QueueEmpty(q)){errno = EMPTY_QUEUE;return FALSE;}*x = q->front->data;return TRUE; }// 銷毀隊(duì)列 int Destroy_Queu (Queue* q) {if (NULL == q){errno = ERROR;return FALSE;}int x;while (TRUE != QueueEmpty(q)){DeQueue (q, &x);}free(q);return TRUE; }

總結(jié)

以上是生活随笔為你收集整理的数据结构之顺序队列和链式队列常用的一些操作的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。