-
【数据结构初阶】双链表
1.双链表的实现
1.1结口实现
#include#include #include typedef int LTDateType; typedef struct ListNode { struct ListNode* next; struct ListNode* prev; LTDateType date; }LTNode; //创造结点 LTNode* BuyLTNode(LTDateType x); //初始化双链表 LTNode* LTInit(); //打印双链表 void LTPrint(LTNode* phead); //尾插 void LTPushBack(LTNode* phead, LTDateType x); //尾删 void LTPopBack(LTNode* phead); //头插 void LTPushFront(LTNode* phead, LTDateType x); //头删 void LTPopFront(LTNode* phead); //计算 int LTSize(LTNode* phead); //查找 LTNode* LTFind(LTNode* phead, LTDateType x); //pos位置插入 void LTInsert(LTNode* pos, LTDateType x); //删除pos位置 void LTErase(LTNode* pos); //销毁双链表 void LTDestroy(LTNode* phead); - 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
1.2申请结点
//创造结点 LTNode* BuyLTNode(LTDateType x) { LTNode* node = (LTNode*)malloc(sizeof(LTNode)); if (node == NULL) { perror("malloc fail"); exit(-1); } node->date = x; node->next = NULL; node->prev = NULL; return node; }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
1.3初始化双链表
//初始化双链表 LTNode* LTInit() { LTNode* phead = BuyLTNode(0); phead->next = phead; phead->prev = phead; return phead; }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
1.4打印双链表
//打印双链表 void LTPrint(LTNode* phead) { assert(phead); printf("phead<=>"); LTNode* cur = phead->next; while (cur != phead) { printf("%d<=>", cur->date); cur = cur->next; } printf("\n"); }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
1.5尾插
//尾插 void LTPushBack(LTNode* phead, LTDateType x) { assert(phead); LTNode* tail = phead->prev; LTNode* newnode = BuyLTNode(x); newnode->prev = tail; tail->next = newnode; newnode->next = phead; phead->prev = newnode; }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
1.6尾删
//尾删 void LTPopBack(LTNode* phead) { assert(phead); assert(phead->next != phead); LTNode* tail = phead->prev; LTNode* tailPrev = tail->prev; free(tail); tailPrev->next = phead; phead->prev = tailPrev; }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
1.7头插
//头插 void LTPushFront(LTNode* phead, LTNode* x) { assert(phead); LTNode* newnode = BuyLTNode(x); LTNode* first = phead->next; phead->next = newnode; newnode->prev = phead; newnode->next = first; first->prev = newnode; }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
1.8头删
//头删 void LTPopFront(LTNode* phead) { assert(phead); assert(phead->next != phead); LTNode* first = phead->next; LTNode* second = first->next; free(first); phead->next = second; second->prev = phead; }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
1.9计算大小
//计算 int LTSize(LTNode* phead) { assert(phead); int size = 0; LTNode* cur = phead->next; while (cur != phead) { size++; cur = cur->next; } return size; }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
1.10查找
//查找 LTNode* LTFind(LTNode* phead, LTDateType x) { assert(phead); LTNode* cur = phead->next; while (cur != phead) { if (cur->date == x) return cur; cur = cur->next; } return NULL; }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
1.11pos位置插入
//在pos位置插入 void LTInsert(LTNode* pos, LTDateType x) { assert(pos); LTNode* posPrev = pos->prev; LTNode* newnode = BuyLTNode(x); posPrev->next = newnode; newnode->prev = posPrev; newnode->next = pos; pos->prev = newnode; }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
1.12删除pos位置
//删除pos位置 void LTErase(LTNode* pos) { assert(pos); LTNode* posNext = pos->next; LTNode* posPrev = pos->prev; free(pos); posPrev->next = posNext; posNext->prev = posPrev; }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
1.12删除双链表
//销毁双链表 void LTDestroy(LTNode* phead) { assert(phead); LTNode* cur = phead->next; while (cur != phead) { LTNode* next = cur->next; free(cur); cur = cur->next; } free(phead); }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
全部码源
List.h
#include#include #include typedef int LTDateType; typedef struct ListNode { struct ListNode* next; struct ListNode* prev; LTDateType date; }LTNode; //创造结点 LTNode* BuyLTNode(LTDateType x); //初始化双链表 LTNode* LTInit(); //打印双链表 void LTPrint(LTNode* phead); //尾插 void LTPushBack(LTNode* phead, LTDateType x); //尾删 void LTPopBack(LTNode* phead); //头插 void LTPushFront(LTNode* phead, LTDateType x); //头删 void LTPopFront(LTNode* phead); //计算 int LTSize(LTNode* phead); //查找 LTNode* LTFind(LTNode* phead, LTDateType x); //pos位置插入 void LTInsert(LTNode* pos, LTDateType x); //删除pos位置 void LTErase(LTNode* pos); //销毁双链表 void LTDestroy(LTNode* phead); - 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
List.c
#include"List.h" //创造结点 LTNode* BuyLTNode(LTDateType x) { LTNode* node = (LTNode*)malloc(sizeof(LTNode)); if (node == NULL) { perror("malloc fail"); exit(-1); } node->date = x; node->next = NULL; node->prev = NULL; return node; } //初始化双链表 LTNode* LTInit() { LTNode* phead = BuyLTNode(0); phead->next = phead; phead->prev = phead; return phead; } //打印双链表 void LTPrint(LTNode* phead) { assert(phead); printf("phead<=>"); LTNode* cur = phead->next; while (cur != phead) { printf("%d<=>", cur->date); cur = cur->next; } printf("\n"); } //尾插 void LTPushBack(LTNode* phead, LTDateType x) { assert(phead); LTNode* tail = phead->prev; LTNode* newnode = BuyLTNode(x); newnode->prev = tail; tail->next = newnode; newnode->next = phead; phead->prev = newnode; } //尾删 void LTPopBack(LTNode* phead) { assert(phead); assert(phead->next != phead); LTNode* tail = phead->prev; LTNode* tailPrev = tail->prev; free(tail); tailPrev->next = phead; phead->prev = tailPrev; } //头插 void LTPushFront(LTNode* phead, LTNode* x) { assert(phead); LTNode* newnode = BuyLTNode(x); LTNode* first = phead->next; phead->next = newnode; newnode->prev = phead; newnode->next = first; first->prev = newnode; } //头删 void LTPopFront(LTNode* phead) { assert(phead); assert(phead->next != phead); LTNode* first = phead->next; LTNode* second = first->next; free(first); phead->next = second; second->prev = phead; } //计算 int LTSize(LTNode* phead) { assert(phead); int size = 0; LTNode* cur = phead->next; while (cur != phead) { size++; cur = cur->next; } return size; } //查找 LTNode* LTFind(LTNode* phead, LTDateType x) { assert(phead); LTNode* cur = phead->next; while (cur != phead) { if (cur->date == x) return cur; cur = cur->next; } return NULL; } //在pos位置插入 void LTInsert(LTNode* pos, LTDateType x) { assert(pos); LTNode* posPrev = pos->prev; LTNode* newnode = BuyLTNode(x); posPrev->next = newnode; newnode->prev = posPrev; newnode->next = pos; pos->prev = newnode; } //删除pos位置 void LTErase(LTNode* pos) { assert(pos); LTNode* posNext = pos->next; LTNode* posPrev = pos->prev; free(pos); posPrev->next = posNext; posNext->prev = posPrev; } //销毁双链表 void LTDestroy(LTNode* phead) { assert(phead); LTNode* cur = phead->next; while (cur != phead) { LTNode* next = cur->next; free(cur); cur = cur->next; } free(phead); }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
- 72
- 73
- 74
- 75
- 76
- 77
- 78
- 79
- 80
- 81
- 82
- 83
- 84
- 85
- 86
- 87
- 88
- 89
- 90
- 91
- 92
- 93
- 94
- 95
- 96
- 97
- 98
- 99
- 100
- 101
- 102
- 103
- 104
- 105
- 106
- 107
- 108
- 109
- 110
- 111
- 112
- 113
- 114
- 115
- 116
- 117
- 118
- 119
- 120
- 121
- 122
- 123
- 124
- 125
- 126
- 127
- 128
- 129
- 130
- 131
- 132
- 133
- 134
- 135
- 136
- 137
- 138
- 139
- 140
- 141
- 142
- 143
- 144
- 145
- 146
- 147
- 148
- 149
- 150
- 151
- 152
- 153
- 154
- 155
- 156
- 157
- 158
- 159
- 160
- 161
- 162
- 163
test.c
#include"List.h" void TestList1() { LTNode* plist = LTInit(); LTPushBack(plist, 1); LTPushBack(plist, 2); LTPushBack(plist, 3); LTPushBack(plist, 4); LTPushBack(plist, 5); LTPrint(plist); LTPopBack(plist); LTPrint(plist); LTPushFront(plist, 20); LTPrint(plist); } void TestList2() { LTNode* plist = LTInit(); LTPushBack(plist, 1); LTPushBack(plist, 2); LTPushBack(plist, 3); LTPushBack(plist, 4); LTPushBack(plist, 5); LTPrint(plist); LTPopFront(plist); LTPrint(plist); LTSize(plist); } void TestList3() { LTNode* plist = LTInit(); LTPushBack(plist, 1); LTPushBack(plist, 2); LTPushBack(plist, 3); LTPushBack(plist, 4); LTPushBack(plist, 5); LTPrint(plist); LTNode* pos = LTFind(plist, 3); LTInsert(pos, 20); LTPrint(plist); } void TestList4() { LTNode* plist = LTInit(); LTPushBack(plist, 1); LTPushBack(plist, 2); LTPushBack(plist, 3); LTPushBack(plist, 4); LTPushBack(plist, 5); LTPrint(plist); LTNode* pos = LTFind(plist, 3); LTErase(pos); LTPrint(plist); } int main() { TestList4(); return 0; }- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
💘不知不觉，【数据结构初阶】双链表 以告一段落。通读全文的你肯定收获满满，让我们继续为数据结构学习共同奋进!!!
-
相关阅读:
图像运算和图像增强九
Git操作复习笔记
（248）Verilog HDL：奇偶校验
最强Python面试题之Python基础题
解决 MyBatis-Plus 中 ID 自增问题
【CSS】5分钟带你彻底搞懂 W3C & IE 盒模型
【C++】类和对象（一）：什么是面向对象，访问限定符有哪些，类定义细节，结构体和类的关系。
Nginx代理MySQL的配置
洛谷刷题C语言：数字游戏、面积、日期、苹果采购、字母转换
Set接口的实现类---TreeSet
- 原文地址：https://blog.csdn.net/2201_75642960/article/details/134511043
