#pragma once #include<assert.h> #include<malloc.h> #include<stdio.h> typedef int DLDataType;//定義鏈表結(jié)點(diǎn)結(jié)構(gòu) typedef struct DListNode{DLDataType value;struct DListNode *prev; //指向前一個(gè)結(jié)點(diǎn)struct DListNode *next; //指向后一個(gè)結(jié)點(diǎn) } DListNode;//定義雙向鏈表結(jié)構(gòu) typedef struct DList{DListNode *head; //表示鏈表頭結(jié)點(diǎn) }DList;DListNode *DListBuyNode(DLDataType value){DListNode *node = (DListNode *)malloc(sizeof (DListNode));node->value = value;node->next =node->prev= NULL;return node; }//初始化 void DListInit(DList *dlist){dlist->head = DListBuyNode(0);dlist->head->next = dlist->head;dlist->head->prev = dlist->head; }//銷(xiāo)毀 //1. 清空鏈表 void DListClear(DList *dlist){DListNode *cur, *next;cur = dlist->head->next;while (cur != dlist->head){next = cur->next;free(cur);cur = next;}dlist->head->next = dlist->head->prev = dlist->head; }//2. 徹底銷(xiāo)毀鏈表 void DListDestroy(DList *dlist){DListClear(dlist);free(dlist->head);dlist->head = NULL; }//頭插 void DListPushFront(DList *dlist, DLDataType value){DListNode *node = DListBuyNode(value);node->prev = dlist->head;node->next = dlist->head->next;dlist->head->next->prev = node;dlist->head->next = node;}//尾插 void DlistPushBack(DList *dlist, DLDataType value){DListNode *node = DListBuyNode(value);node->prev = dlist->head->prev;node->next = dlist->head;node->prev->next = node;node->next->prev = node; }//頭刪 void DlistPopFront(DList *dlist){assert(dlist->head->next != dlist->head);DListNode *cur = dlist->head->next; //cur指向第一個(gè)結(jié)點(diǎn)dlist->head->next = cur->next; //頭結(jié)點(diǎn)指向第二個(gè)結(jié)點(diǎn)cur->next->prev = dlist->head; //第二個(gè)結(jié)點(diǎn)前指針指向頭結(jié)點(diǎn)free(cur); //刪除第一個(gè)結(jié)點(diǎn) }//尾刪 void DlistPopBack(DList *dlist){assert(dlist->head->next != dlist->head); //確保鏈表不為空DListNode *cur = dlist->head->prev;cur->prev->next = dlist->head;cur->next->prev = cur->prev;free(cur); }//查找 DListNode * DListFind(const DList *dlist, DLDataType value){DListNode *cur;for (cur = dlist->head->next; cur != dlist->head; cur = cur->next){if (cur->value == value){return cur;}}return NULL; }void DListInsert(DListNode *pos, DLDataType value){DListNode *node = DListBuyNode(value);node->prev = pos->prev;node->next = pos;node->prev->next = node;pos->prev = node; }void DListErase(DListNode *pos){pos->prev->next = pos->next;pos->next->prev = pos->prev;free(pos); }void DListPrintf(const DList *dlist){for (DListNode *cur = dlist->head->next; cur != dlist->head; cur = cur->next){printf("%d-->", cur->value);}printf("\n"); }void TestDList(){DList list;DListInit(&list);DListPrintf(&list);DlistPushBack(&list, 1);DlistPushBack(&list, 2);DlistPushBack(&list, 3);DListPrintf(&list);DListPushFront(&list, 11);DListPushFront(&list, 12);DListPushFront(&list, 13);DListPrintf(&list); } 創(chuàng)作挑戰(zhàn)賽新人創(chuàng)作獎(jiǎng)勵(lì)來(lái)咯，堅(jiān)持創(chuàng)作打卡瓜分現(xiàn)金大獎(jiǎng)

總結(jié)

以上是生活随笔為你收集整理的再写双向循环链表的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

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