快捷導(dǎo)航

C語言實(shí)現(xiàn)鏈隊(duì)列基本操作

更新時間：2021年09月23日 16:19:00 作者：似曾不相識

這篇文章主要為大家詳細(xì)介紹了C語言實(shí)現(xiàn)鏈隊(duì)列基本操作，文中示例代碼介紹的非常詳細(xì)，具有一定的參考價(jià)值，感興趣的小伙伴們可以參考一下

隊(duì)列的鏈?zhǔn)酱鎯Y(jié)構(gòu)實(shí)現(xiàn)，相比于循環(huán)隊(duì)列實(shí)現(xiàn)要復(fù)雜一些，但是沒有隊(duì)滿的限制。

頭文件聲明

#include <stdio.h>
#include <stdlib.h>

/**
 * 隊(duì)列的鏈?zhǔn)酱鎯?shí)現(xiàn)
 * [帶頭結(jié)點(diǎn)的單鏈表]
 * [-類似于鏈棧，隊(duì)列的鏈?zhǔn)酱鎯?shí)現(xiàn)也不會出現(xiàn)隊(duì)滿的情況]
 */
//數(shù)據(jù)類型
typedef int ElemType;

//定義節(jié)點(diǎn)
typedef struct SqQueueNode
{
 ElemType data;//數(shù)據(jù)域
 struct SqQueueNode* next; //指針域
}SqQueueNode;
//定義隊(duì)列
typedef struct SqQueueLink{
 SqQueueNode* front;//隊(duì)頭指針
 SqQueueNode* rear;//隊(duì)尾指針
}SqQueueLink;

//初始化隊(duì)列
void InitQueueLink(SqQueueLink* q);
//判斷隊(duì)空
int EmptyQueueLink(SqQueueLink q);
//入隊(duì)操作
void EnQueueLink(SqQueueLink *q,ElemType e);
//出隊(duì)操作
void DeQueueLink(SqQueueLink q,ElemType *e);
//獲取隊(duì)列長度
int LengthQueueLink(SqQueueLink q);
//打印隊(duì)列
void printSqQueueLink(SqQueueLink q);
//獲取隊(duì)頭元素
void GetHeadLink(SqQueueLink q,ElemType* e);

函數(shù)實(shí)現(xiàn)

#include "SqQueueLink.h"


//初始化隊(duì)列
void InitQueueLink(SqQueueLink* q){
 //創(chuàng)建頭結(jié)點(diǎn)
 SqQueueNode* pNode=(SqQueueNode*)malloc(sizeof(SqQueueNode));
 pNode->next=NULL;//指針域置空[數(shù)據(jù)域不存儲任何內(nèi)容]
 //初始化隊(duì)列-[使隊(duì)頭指針和隊(duì)尾指針指向頭結(jié)點(diǎn)]
 q->front=pNode;
 q->rear=pNode;
}

//判斷隊(duì)空
int EmptyQueueLink(SqQueueLink q){
 return q.front==q.rear;
}

//入隊(duì)操作
void EnQueueLink(SqQueueLink *q,ElemType e){
 //創(chuàng)建新的數(shù)據(jù)元素節(jié)點(diǎn)
 SqQueueNode* newNode=(SqQueueNode*)malloc(sizeof(SqQueueNode));
 newNode->data=e;//指定數(shù)據(jù)域
 newNode->next=NULL;//指針域置空
 //入隊(duì)操作[從隊(duì)尾入隊(duì)]
 q->rear->next=newNode;
 q->rear=newNode;
}

//出隊(duì)操作
void DeQueueLink(SqQueueLink q,ElemType *e){
 //[從隊(duì)頭出隊(duì)]
 SqQueueNode* p=NULL;
 //是否隊(duì)空
 if (q.front==q.rear)
  return;
 p=q.front->next;//獲取首節(jié)點(diǎn)
 *e=p->data;
 //使隊(duì)頭指針指向下一節(jié)點(diǎn)
 q.front->next=p->next;
 //如果原隊(duì)列中只有一個節(jié)點(diǎn)，要將隊(duì)尾指針和隊(duì)頭指針均指向同一節(jié)點(diǎn)-置空
 if (q.rear==p)
  q.rear=q.front;
 //釋放原首節(jié)點(diǎn)
 free(p);
}

//獲取隊(duì)列長度
int LengthQueueLink(SqQueueLink q){
 //輔助指針
 SqQueueNode* pNode=q.front->next;
 int count=0;
 //獲取隊(duì)列長度
 while (pNode!=q.rear)
 {
  count++;
  pNode=pNode->next;
 }
 return count;
}

//打印隊(duì)列
void printSqQueueLink(SqQueueLink q){
 //輔助指針
 SqQueueNode* p=q.front->next;
 while (p!=q.rear)
 {
  printf("%4d",p->data);
  p=p->next;
 }
 printf("\n");
}

//獲取隊(duì)頭元素
void GetHeadLink(SqQueueLink q,ElemType* e){
 //判斷隊(duì)列是否為空
 if (q.front==q.rear)
  return;
 //獲取隊(duì)頭元素的值
 *e=q.front->next->data;
}

函數(shù)測試

#include "SqQueueLink.h"

int main(int argc,char** argv){
 //聲明隊(duì)列
 SqQueueLink sqLink;
 int i;
 ElemType data;
 //初始化隊(duì)列
 InitQueueLink(&sqLink);
 //判斷隊(duì)列是否為空
 printf("is Empty?%d\n",EmptyQueueLink(sqLink));
 //入隊(duì)操作
 for (i=0;i<=20;i++)
 {
  EnQueueLink(&sqLink,i+1);
 }
 //判斷隊(duì)列是否為空
 printf("is Empty?%d,len=%d\n",EmptyQueueLink(sqLink),LengthQueueLink(sqLink));
 //打印隊(duì)列
 printSqQueueLink(sqLink);
 //出隊(duì)列操作
 DeQueueLink(sqLink,&data);
 //判斷隊(duì)列是否為空
 printf("is Empty?%d,len=%d\n",EmptyQueueLink(sqLink),LengthQueueLink(sqLink));
 //打印隊(duì)列
 printSqQueueLink(sqLink);
 //獲取隊(duì)頭元素的值
 GetHeadLink(sqLink,&data);
 printf("the first node value is %d\n",data);
 return 0;
}