一、双向链表的概念、结构与操作
1.1概念
双向链表全称双向带头循环链表,属于链表的一种。在双向链表中,每个节点包括数据元素、指向下一个节点的指针以及指向前一个节点的指针。其优点在于:可从前往后和从后往前两个方向进行遍历,在某些操作(如删除节点时)更加灵活和高效。
1.2结构
节点结构:数据+指向下一个节点的指针+指向上一个节点的指针
1.3操作
双向链表基本的操作包括:初始化、插入、删除、查找、销毁
二、双向链表的代码实现
2.1 双向链表的头文件
【注】此处的头文件相当于代码的目录
//初始化创建哨兵位
void LTInit(LTNode** pphead);
//增加节点
LTNode* LTBuyNode(LTdataType x);
//打印
void LTPrint(LTNode* phead);
//尾插
void LTPushBack(LTNode* phead, LTdataType x);
//头插
void LTPushFront(LTNode* phead, LTdataType x);
//尾删
void LTPopBack(LTNode* phead);
//头删
void LTPopFront(LTNode* phead);
//判断哨兵位(头结点)是否为空
bool LTEmpty(LTNode* phead);
//链表查找
LTNode* LTFind(LTNode* phead, LTdataType x);
//在pos位置之后插入节点
void LTInsert(LTNode* pos, LTdataType x);
//删除指定位置节点
void LTErase(LTNode* pos);
//销毁
void LTDesTroy(LTNode** pphead);
2.2 定义双向链表节点结构:
双向带头,定义指针next和prev
//定义双向链表节点的结构
typedef int LTdataType;
typedef struct ListNode
{
LTdataType data;
struct ListNode* next;//指向下一个节点的指针
struct ListNode* prev;//指向上一个节点的指针
}LTNode;
2.3链表增加节点
LTNode* LTBuyNode(LTdataType x)
{
LTNode* newnode = (LTNode*)malloc(sizeof(LTNode));
if (newnode == NULL)
{
perror("malloc fail!");
exit(1);
}
newnode->data = x;
newnode->next = newnode->prev = newnode;
return newnode;
}
2.4链表初始化
创建一个哨兵位
//初始化
void LTInit(LTNode** pphead)
{
//创建一个哨兵位(头结点)
*pphead = LTBuyNode(-1);
}
2.5链表的打印
void LTPrint(LTNode* phead)
{
LTNode* pcur = phead->next;
while (pcur != phead)
{
printf("%d->", pcur->data);
pcur = pcur->next;
}
printf("head");
printf("\n");
}
2.6 链表的插入(包括头插和尾插)
void LTPushBack(LTNode* phead, LTdataType x)
{
LTNode* newnode = LTBuyNode(x);
LTNode* tail = phead->prev;
tail->next = newnode;
newnode->prev = tail;
newnode->next = phead;
phead->prev = newnode;
}
尾插类比,即哨兵位上一个节点进行插入!
void LTPushFront(LTNode* phead, LTdataType x)
{
LTNode* newnode = LTBuyNode(x);
newnode->next = phead->next;
newnode->prev = phead;
phead->next->prev = newnode;
phead->next = newnode;
}
2.7 链表的判空
在进行删除之前,我们要先判断该链表是否为空,若链表为空,则不能进行删除操作!我们用bool类型判断。
bool LTEmpty(LTNode* phead)
{
assert(phead);
return phead->next == phead;
}
2.8 链表的删除(包括头删和尾删)
删除之前先进行断言,判断链表是否为空,然后画图分析节点变化。
void LTPopBack(LTNode* phead)
{
assert(phead);
assert(!LTEmpty(phead));
LTNode* del = phead->prev;
LTNode* prev = del->prev;
prev->next = phead;
phead->prev = prev;
free(del);
del = NULL;
}
void LTPopFront(LTNode* phead)
{
assert(phead);
assert(!LTEmpty(phead));
LTNode* del = phead->next;
LTNode* tail = del->next;
tail->prev = phead;
phead->next = tail;
free(del);
del = NULL;
}
2.9 链表的查找
先断言,然后定义一个指针存储头结点的下一个节点,进行循环遍历。
LTNode* LTFind(LTNode* phead, LTdataType x)
{
assert(phead);
LTNode* pcur = phead->next;
while (pcur != phead)
{
if (pcur->data == x)
{
return pcur;
}
pcur = pcur->next;
}
return NULL;
}
2.10 链表指定位置的插入
还是先断言,然后申请一个新的节点存储要插入的数据,在指定位置后插入。
void LTInsert(LTNode* pos, LTdataType x)
{
assert(pos);
LTNode* newnode = LTBuyNode(x);
newnode->next = pos->next;
newnode->prev = pos;
pos->next->prev = newnode;
pos->next = newnode;
}
2.11 链表删除指定位置节点
void LTErase(LTNode* pos)
{
assert(pos);
pos->prev->next = pos->next;
pos->next->prev = pos->prev;
free(pos);
pos = NULL;
}
2.12链表的销毁
void LTDesTroy(LTNode** pphead)
{
assert(pphead && *pphead);
LTNode* pcur = (*pphead)->next;
while (pcur!= *pphead)
{
LTNode* Next = pcur->next;
free(pcur);
pcur = Next;
}
free(*pphead);
*pphead = NULL;
pcur = NULL;
}
为了保持接口一致,我们可以优化接口为一级指针,因此销毁操作可变为:
`void LTDesTroy2(LTNode* phead)
{
assert(phead);
LTNode* pcur = phead->next;
while (pcur != phead)
{
LTNode* Next = pcur->next;
free(pcur);
pcur = Next;
}
free(phead);
phead = pcur = NULL;
}
三、完整源代码:
LT.c文件的完整代码。
#include"LT.h"
LTNode* LTBuyNode(LTdataType x)
{
LTNode* newnode = (LTNode*)malloc(sizeof(LTNode));
if (newnode == NULL)
{
perror("malloc fail!");
exit(1);
}
newnode->data = x;
newnode->next = newnode->prev = newnode;
return newnode;
}
//初始化
void LTInit(LTNode** pphead)
{
//创建一个哨兵位(头结点)
*pphead = LTBuyNode(-1);
}
//插入
void LTPushBack(LTNode* phead, LTdataType x)
{
LTNode* newnode = LTBuyNode(x);
LTNode* tail = phead->prev;
tail->next = newnode;
newnode->prev = tail;
newnode->next = phead;
phead->prev = newnode;
}
void LTPushFront(LTNode* phead, LTdataType x)
{
LTNode* newnode = LTBuyNode(x);
newnode->next = phead->next;
newnode->prev = phead;
phead->next->prev = newnode;
phead->next = newnode;
}
void LTPrint(LTNode* phead)
{
LTNode* pcur = phead->next;
while (pcur != phead)
{
printf("%d->", pcur->data);
pcur = pcur->next;
}
printf("head");
printf("\n");
}
bool LTEmpty(LTNode* phead)
{
assert(phead);
return phead->next == phead;
}
//删除
void LTPopBack(LTNode* phead)
{
assert(phead);
assert(!LTEmpty(phead));
LTNode* del = phead->prev;
LTNode* prev = del->prev;
prev->next = phead;
phead->prev = prev;
free(del);
del = NULL;
}
void LTPopFront(LTNode* phead)
{
assert(phead);
assert(!LTEmpty(phead));
LTNode* del = phead->next;
LTNode* tail = del->next;
tail->prev = phead;
phead->next = tail;
free(del);
del = NULL;
}
LTNode* LTFind(LTNode* phead, LTdataType x)
{
assert(phead);
LTNode* pcur = phead->next;
while (pcur != phead)
{
if (pcur->data == x)
{
return pcur;
}
pcur = pcur->next;
}
return NULL;
}
//在pos位置之后插入结点
void LTInsert(LTNode* pos, LTdataType x)
{
assert(pos);
LTNode* newnode = LTBuyNode(x);
newnode->next = pos->next;
newnode->prev = pos;
pos->next->prev = newnode;
pos->next = newnode;
}
//删除指定位置结点
void LTErase(LTNode* pos)
{
assert(pos);
pos->prev->next = pos->next;
pos->next->prev = pos->prev;
free(pos);
pos = NULL;
}
//销毁
void LTDesTroy(LTNode** pphead)
{
assert(pphead && *pphead);
LTNode* pcur = (*pphead)->next;
while (pcur != *pphead)
{
LTNode* Next = pcur->next;
free(pcur);
pcur = Next;
}
free(*pphead);
*pphead = NULL;
pcur = NULL;
}
void LTDesTroy2(LTNode* phead)
{
assert(phead);
LTNode* pcur = phead->next;
while (pcur != phead)
{
LTNode* Next = pcur->next;
free(pcur);
pcur = Next;
}
free(phead);
phead = pcur = NULL;
}
test.c文件的代码:
void test01()
{
//创建双向链表变量
LTNode* plist = NULL;
LTInit(&plist);
//LTNode* plist = LTInit();
LTPushBack(plist, 1);
LTPushBack(plist, 2);
LTPushBack(plist, 3);
LTPushBack(plist, 4);
LTPushBack(plist, 5);
LTPrint(plist);
/*LTPushFront(plist, 1);
LTPushFront(plist, 2);
LTPushFront(plist, 3);
LTPushFront(plist, 4);
LTPushFront(plist, 5);
LTPrint(plist);*/
//LTPopBack(plist);
//LTPopBack(plist);
/*LTPopBack(plist);
LTPrint(plist);
LTPopBack(plist);
LTPrint(plist);*/
/*LTPopFront(plist);
LTPrint(plist);*/
LTNode* pos = LTFind(plist, 3);
if (pos == NULL)
{
printf("没有找到!\n");
}
else
{
printf("找到了!\n");
}
LTInsert(pos, 11);
LTErase(pos);
LTPrint(plist);
//LTDesTroy(&plist);
LTDesTroy2(plist);
plist = NULL;
}
int main()
{
test01();
return 0;
}
test.c文件的代码时用于测试,按需取,非常粗糙…