/********************************************************************************************************
*
*
* 設(shè)計(jì)雙向循環(huán)鏈表的接口
*
*
*
* Copyright (c) 2023-2024 a1583839363@163.com All right Reserved
* ******************************************************************************************************/
//指的是雙向循環(huán)鏈表中的結(jié)點(diǎn)有效數(shù)據(jù)類型，用戶可以根據(jù)需要進(jìn)行修改
typedef int DataType_t;
//構(gòu)造雙向循環(huán)鏈表的結(jié)點(diǎn),鏈表中所有結(jié)點(diǎn)的數(shù)據(jù)類型應(yīng)該是相同的
typedef struct DoubleCircularLinkedList
{
DataType_t data; //結(jié)點(diǎn)的數(shù)據(jù)域
struct DoubleCircularLinkedList *prev; //直接前驅(qū)的指針域
struct DoubleCircularLinkedList *next; //直接后繼的指針域
}DoubleCirLList_t;
//創(chuàng)建一個(gè)空雙向循環(huán)鏈表，空鏈表應(yīng)該有一個(gè)頭結(jié)點(diǎn)，對(duì)鏈表進(jìn)行初始化
DoubleCirLList_t * DoubleCirLList_Create(void)
{
//1.創(chuàng)建一個(gè)頭結(jié)點(diǎn)并對(duì)頭結(jié)點(diǎn)申請(qǐng)內(nèi)存
DoubleCirLList_t *Head = (DoubleCirLList_t *)calloc(1,sizeof(DoubleCirLList_t));
if (NULL == Head)
{
perror("Calloc memory for Head is Failed");
exit(-1);
}
//2.對(duì)頭結(jié)點(diǎn)進(jìn)行初始化，頭結(jié)點(diǎn)是不存儲(chǔ)數(shù)據(jù)域，指針域指向自身即可，體現(xiàn)“循環(huán)”
Head->prev = Head;
Head->next = Head;
//3.把頭結(jié)點(diǎn)的地址返回即可
return Head;
}
//創(chuàng)建新的結(jié)點(diǎn)，并對(duì)新結(jié)點(diǎn)進(jìn)行初始化（數(shù)據(jù)域 + 指針域）
DoubleCirLList_t * DoubleCirLList_NewNode(DataType_t data)
{
//1.創(chuàng)建一個(gè)新結(jié)點(diǎn)并對(duì)新結(jié)點(diǎn)申請(qǐng)內(nèi)存
DoubleCirLList_t *New = (DoubleCirLList_t *)calloc(1,sizeof(DoubleCirLList_t));
if (NULL == New)
{
perror("Calloc memory for NewNode is Failed");
return NULL;
}
//2.對(duì)新結(jié)點(diǎn)的數(shù)據(jù)域和指針域（2個(gè)）進(jìn)行初始化,指針域指向結(jié)點(diǎn)自身，體現(xiàn)“循環(huán)”
New->data = data;
New->prev = New;
New->next = New;
return New;
}
//頭插
bool DoubleCirLList_HeadInsert(DoubleCirLList_t *Head,DataType_t data)
{
// 1.創(chuàng)建新的結(jié)點(diǎn)，并對(duì)新結(jié)點(diǎn)進(jìn)行初始化
DoubleCirLList_t *New = DoubleCirLList_NewNode(data);
if (NULL == New)
{
printf("can not insert new node\n");
return false;
}
// 2.判斷雙向循環(huán)鏈表是否為空，如果為空，則直接插入即可
if (Head == Head->next)
{
Head->next = New;
New->next = New;
New->prev = New;
return true;
}
// 3.如果雙向鏈表為非空，把新結(jié)點(diǎn)插入到鏈表的頭部
Head->next->prev = New;
New->prev = Head->next->prev;
New->next = Head->next;
Head->next->prev = New;
Head->next = New;
return true;
}
//尾插
bool DoubleCirLList_TailInsert(DoubleCirLList_t *Head,DataType_t data)
{
// 1.創(chuàng)建新的結(jié)點(diǎn)，并對(duì)新結(jié)點(diǎn)進(jìn)行初始化
DoubleCirLList_t *New = DoubleCirLList_NewNode(data);
if (NULL == New)
{
printf("can not insert new node\n");
return false;
}
// 2.判斷雙向鏈表是否為空，如果為空，則直接插入即可
if (Head == Head->next)
{
Head->next = New;
New->next = New;
New->prev = New;
return true;
}
// 3.如果雙向鏈表為非空，把新結(jié)點(diǎn)插入到鏈表的尾部
New->prev = Head->next->prev;
Head->next->prev-next = New;
New->next = Head->next;
Head->next->prev = New;
return true;
}
//指定插
bool DoubleCirLList_DestInsert(DoubleCirLList_t *Head,DataType_t destval,DataType_t data)
{
// 1.創(chuàng)建新的結(jié)點(diǎn)，并對(duì)新結(jié)點(diǎn)進(jìn)行初始化
DoubleCirLList_t *New = DoubleCirLList_NewNode(data);
if (NULL == New)
{
printf("can not insert new node\n");
return false;
}
// 2.判斷雙向鏈表是否為空，如果為空，則直接插入即可
if (Head == Head->next)
{
Head->next = New;
New->next = New;
New->prev = New;
return true;
}
// 3.如果雙向鏈表為非空，遍歷鏈表，找到目標(biāo)結(jié)點(diǎn)
DoubleCirLList_t *Dest = Head->next;
while (Dest->data != destval && Dest != NULL)
{
Dest = Dest->next;
}
if (NULL == Dest)
{
return false;
}
// 4.說(shuō)明找到目標(biāo)結(jié)點(diǎn)，則把新結(jié)點(diǎn)插入到目標(biāo)結(jié)點(diǎn)的后面
New->next = Dest->next;
Dest->next->prev = New;
New->prev = Dest;
Dest->next = New;
return true;
}
//頭刪
bool DoubleCirLList_HeadDel(DoubleCirLList_t *Head)
{
// 1.判斷鏈表是否為空，如果為空，則直接退出
if (NULL == Head->next)
{
return false;
}
// 2.對(duì)鏈表的首結(jié)點(diǎn)的地址進(jìn)行備份
DoubleCirLList_t *Temp = Head->next;
// 3.鏈表是非空的，則直接刪除首結(jié)點(diǎn)
Temp->prev->next = Temp->next;
Temp->next->prev = Temp->prev;
Temp->next = NULL;
Head->next = Temp->next;
Temp->prev = NULL;
free(Temp);
return true;
}
// 尾刪
bool DoubleCirLList_TailDel(DoubleCirLList_t *Head)
{
// 1.判斷鏈表是否為空，如果為空，則直接退出
if (NULL == Head->next)
{
return false;
}
// 2.對(duì)鏈表的尾結(jié)點(diǎn)的地址進(jìn)行備份
DoubleCirLList_t *Tail = Head->next->prev;
// 2.鏈表為非空，刪除尾結(jié)點(diǎn)
Tail->prev->next = Head->next;
Head->next-prev = Tail->prev;
Tail->next = NULL;
Tail->prev = NULL;
free(Tail);
return true;
}
// 指定刪
bool DoubleCirLList_DestDel(DoubleCirLList_t *Head, DataType_t destval, DataType_t data)
{
// 1.判斷鏈表是否為空，如果為空，則直接退出
if (NULL == Head->next)
{
return false;
}
// 2.鏈表是非空的，遍歷鏈表，找到待刪除結(jié)點(diǎn)
DoubleCirLList_t *Dest = Head;
while (Dest->data != destval && Dest != NULL)
{
Dest = Dest->next;
}
if (NULL == Dest)
{
return false;
}
// 3.刪除指定結(jié)點(diǎn)
Dest->prev->next = Dest->next;
Dest->next->prev = Dest->prev;
Dest->prev = NULL;
Dest->next = NULL;
free(Dest);
}
// 遍歷雙向循壞鏈表
bool DoubleLList_Print(DoubleCirLList_t *Head)
{
//對(duì)雙向循環(huán)鏈表的頭結(jié)點(diǎn)的地址進(jìn)行備份
DoubleCirLList_t *Phead = Head;
//判斷當(dāng)前鏈表是否為空，為空則直接退出
if (Head->next == Head)
{
printf("current linkeflist is empty!\n");
return false;
}
//從首結(jié)點(diǎn)開始遍歷
while(Phead->next)
{
//把頭結(jié)點(diǎn)的直接后繼作為新的頭結(jié)點(diǎn)
Phead = Phead->next;
//輸出頭結(jié)點(diǎn)的直接后繼的數(shù)據(jù)域
printf("data = %d\n",Phead->data);
//判斷是否到達(dá)尾結(jié)點(diǎn)，尾結(jié)點(diǎn)的next指針是指向首結(jié)點(diǎn)的地址
if (Phead->next == Head->next)
{
break;
}
}
return true;
}
int main(int argc, char const *argv[])
{
return 0;
}文章來(lái)源地址http://www.zghlxwxcb.cn/news/detail-857582.html
文章來(lái)源：http://www.zghlxwxcb.cn/news/detail-857582.html
到了這里，關(guān)于C語(yǔ)言數(shù)據(jù)結(jié)構(gòu)：雙向循環(huán)鏈表的增刪操作的文章就介紹完了。如果您還想了解更多內(nèi)容，請(qǐng)?jiān)谟疑辖撬阉鱐OY模板網(wǎng)以前的文章或繼續(xù)瀏覽下面的相關(guān)文章，希望大家以后多多支持TOY模板網(wǎng)！
