数据结构-双向链表-C语言代码

已于 2022-09-28 15:42:05 修改
阅读量362 收藏
点赞数
文章标签： 链表 数据结构 c语言
于 2022-08-06 14:24:23 首次发布
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.youkuaiyun.com/qq_66518801/article/details/126189551
版权
本文详细介绍了双向链表的实现，包括结点定义、初始化、打印、节点操作（头插、头删、尾插、尾删）、查找、插入和删除，以及整个数据结构的销毁过程。通过实例代码展示了如何使用C语言实现一个完整的双向链表数据结构。

摘要生成于 C知道 ，由 DeepSeek-R1 满血版支持， 前往体验 >

目录

一、双向链表的实现

1.结点定义和头指针的创建

typedef int LTDataType; //把要存储的数据重新定义一下
typedef struct ListNode
{
	LTDataType data; //数据域
	struct ListNode* next;//定义一个指针
	struct ListNode* prev;
}LTNode;

2.初始化实现

//初始化
LTNode* ListInit()
{
	LTNode* guard = (LTNode*)malloc(sizeof(LTNode));
	if (guard == NULL)
	{
		perror("malloc fail");
		exit(-1);
	}
	guard->next = guard;
	guard->prev = guard;
	return guard;
}

3.打印接口实现

//打印
void ListPrint(LTNode* phead)	//这里用一级指针，不需要修改头指针
{
	assert(phead);
	printf("phead<=>");//先打印哨兵头
	LTNode* cur = phead->next;
	while (cur != phead)//就一个头
	{
		printf("%d<=>", cur->data);
		cur = cur->next;
	}
	printf("\n");
}

4.开辟新的节点

//开辟结点接口
LTNode* BuyLTNode(LTDataType x)
{
	LTNode* node = (LTNode*)malloc(sizeof(LTNode));
	if (node == NULL)
	{
		perror("malloc fail");
		exit(-1);
	}
	node->data = x;
	node->next = NULL;
	node->prev = NULL;	

	return node;
}

5.头插接口

//头插
void ListPushFront(LTNode* phead, LTDataType x)
{
	assert(phead);
	//先开辟结点
	LTNode* newnode = BuyLTNode(x);
	LTNode* first = phead->next;

	//先链接newnode 和 phead->next节点之间的关系
	newnode->next = first;
	first->prev = newnode;
	phead->next = newnode;
	newnode->prev = phead;

	//ListInsert(phead->next, x);	//或者直接调用插入
}

6.头删接口

void ListPopFront(LTNode* phead)
{
	assert(phead);
	assert(!ListEmpty(phead));
	LTNode* first = phead->next;
	LTNode* second = first->next;

	phead->next = second;
	second->prev = phead;

	free(first);
	first = NULL;

	//ListErase (phead->next);//直接调用删除
}

7.尾插接口

//尾插
void ListPushBack(LTNode* phead, LTDataType x)
{
	//assert(phead);
	先开辟结点
	//LTNode* newnode = BuyLTNode(x);
	先找尾,此时tail就是尾
	//LTNode* tail = phead->prev;

	//tail->next = newnode;
	//newnode->prev = tail;
	//newnode->next = phead;
	//phead->prev = newnode;

	ListInsert(phead, x);	//或者直接调用插入

}

8.尾删接口

//尾删
void ListPopBack(LTNode* phead)
{
	//assert(phead);
	//assert(!ListEmpty(phead));
	//LTNode* tail = phead->prev;
	//LTNode* prev = tail->prev;

	//prev->next = phead;
	//phead->prev = prev;
	//free(tail);
	//tail = NULL;

	ListErase(phead->prev);	//直接调用删除

}

9.查找接口实现

//查找
LTNode* ListFind(LTNode* phead, LTDataType x)
{
	assert(phead);
	size_t n = 0;
	LTNode* cur = phead->next;
	while (cur != phead)
	{
		if (cur->data = x)
		{
			return cur;
		}
		cur = cur->next;
	}
	return NULL;
}

10.在pos位置之前插入

//在Pos之前插入
void ListInsert(LTNode* pos, LTDataType x)
{
	assert(pos);
	LTNode* prev = pos->prev;
	LTNode* newnode = BuyLTNode(x);

	newnode->next = pos;
	pos->prev = newnode;
	prev->next = newnode;
	newnode->prev = prev;

}

11.删除pos位置

//删除pos位置
void ListErase(LTNode* pos)
{
	assert(pos);
	LTNode* prev = pos->prev;
	LTNode* next = pos->next;

	prev->next = next;
	next->prev = prev;
	free(pos);
	pos = NULL;

}

12.销毁

//销毁
void ListDestory(LTNode* phead)
{
	assert(phead);

	LTNode* cur = phead->next;
	while (cur!= phead)
	{
		LTNode* next = cur->next;
		free(cur);
		cur = next;
	}
	free(phead);
}

二、全部代码

1.SList.h

#pragma once
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include <stdbool.h>


typedef int LTDataType; //把要存储的数据重新定义一下
typedef struct ListNode
{
	LTDataType data; //数据域
	struct ListNode* next;//定义一个指针
	struct ListNode* prev;
}LTNode;


//初始化
LTNode* ListInit();

//开辟结点接口
LTNode* BuyLTNode(LTDataType x);

//打印
void ListPrint(LTNode* phead);

//改变结构体指针，就要传指针的指针

//头插
void ListPushFront(LTNode* phead, LTDataType x);

//尾插
void ListPushBack(LTNode* phead, LTDataType x);

//尾删
void ListPopBack(LTNode* phead);

//头删
void ListPopFront(LTNode* phead);

bool ListEmpty(LTNode* phead);

//链的长度
size_t ListSize(LTNode* phead);

//查找
LTNode* ListFind(LTNode* phead, LTDataType x);


//在Pos之前插入
void ListInsert(LTNode* pos, LTDataType x);

//删除pos位置
void ListErase(LTNode* pos);

//销毁
void ListDestory(LTNode* phead);

2.SList.c

#define _CRT_SECURE_NO_WARNINGS
#include "List.h"

//初始化
LTNode* ListInit()
{
	LTNode* guard = (LTNode*)malloc(sizeof(LTNode));
	if (guard == NULL)
	{
		perror("malloc fail");
		exit(-1);
	}
	guard->next = guard;
	guard->prev = guard;
	return guard;

}

//开辟结点接口
LTNode* BuyLTNode(LTDataType x)
{
	LTNode* node = (LTNode*)malloc(sizeof(LTNode));
	if (node == NULL)
	{
		perror("malloc fail");
		exit(-1);
	}
	node->data = x;
	node->next = NULL;
	node->prev = NULL;	

	return node;
}

//打印
void ListPrint(LTNode* phead)	//这里用一级指针，不需要修改头指针
{
	assert(phead);
	printf("phead<=>");//先打印哨兵头
	LTNode* cur = phead->next;
	while (cur != phead)//就一个头
	{
		printf("%d<=>", cur->data);
		cur = cur->next;
	}
	printf("\n");
}

//头插
void ListPushFront(LTNode* phead, LTDataType x)
{
	assert(phead);
	//先开辟结点
	LTNode* newnode = BuyLTNode(x);
	LTNode* first = phead->next;

	//先链接newnode 和 phead->next节点之间的关系
	newnode->next = first;
	first->prev = newnode;
	phead->next = newnode;
	newnode->prev = phead;

	//ListInsert(phead->next, x);	//或者直接调用插入
}

//尾插
void ListPushBack(LTNode* phead, LTDataType x)
{
	//assert(phead);
	先开辟结点
	//LTNode* newnode = BuyLTNode(x);
	先找尾,此时tail就是尾
	//LTNode* tail = phead->prev;

	//tail->next = newnode;
	//newnode->prev = tail;
	//newnode->next = phead;
	//phead->prev = newnode;

	ListInsert(phead, x);	//或者直接调用插入

}

//头删
void ListPopFront(LTNode* phead)
{
	assert(phead);
	assert(!ListEmpty(phead));
	LTNode* first = phead->next;
	LTNode* second = first->next;

	phead->next = second;
	second->prev = phead;

	free(first);
	first = NULL;

	//ListErase (phead->next);//直接调用删除
}

//尾删
void ListPopBack(LTNode* phead)
{
	//assert(phead);
	//assert(!ListEmpty(phead));
	//LTNode* tail = phead->prev;
	//LTNode* prev = tail->prev;

	//prev->next = phead;
	//phead->prev = prev;
	//free(tail);
	//tail = NULL;

	ListErase(phead->prev);	//直接调用删除

}

bool ListEmpty(LTNode* phead)
{
	assert(phead);

	return phead->next == phead;
}

//求链长
size_t ListSize(LTNode* phead)
{
	assert(phead);

	size_t n= 0;
	LTNode* cur = phead->next;
	while (cur!=phead)
	{
		++n;
		cur = cur->next;
	}
	return n;
}

//查找
LTNode* ListFind(LTNode* phead, LTDataType x)
{
	assert(phead);
	size_t n = 0;
	LTNode* cur = phead->next;
	while (cur != phead)
	{
		if (cur->data = x)
		{
			return cur;
		}
		cur = cur->next;
	}
	return NULL;
}

//在Pos之前插入
void ListInsert(LTNode* pos, LTDataType x)
{
	assert(pos);
	LTNode* prev = pos->prev;
	LTNode* newnode = BuyLTNode(x);

	newnode->next = pos;
	pos->prev = newnode;
	prev->next = newnode;
	newnode->prev = prev;

}

void ListErase(LTNode* pos)
{
	assert(pos);
	LTNode* prev = pos->prev;
	LTNode* next = pos->next;

	prev->next = next;
	next->prev = prev;
	free(pos);
	pos = NULL;

}

//销毁
void ListDestory(LTNode* phead)
{
	assert(phead);

	LTNode* cur = phead->next;
	while (cur!= phead)
	{
		LTNode* next = cur->next;
		free(cur);
		cur = next;
	}
	free(phead);
}

3.Test.c

#define _CRT_SECURE_NO_WARNINGS
#include "List.h"

void TestList1()
{
	//头指针
	LTNode* plist =ListInit(); //plist永远指着第一个哨兵头
	//尾插
	ListPushBack(plist, 1);
	ListPushBack(plist, 2);
	ListPushBack(plist, 3);
	ListPushBack(plist, 4);
	ListPrint(plist);

	//头插
	ListPushFront(plist, 10);
	ListPushFront(plist, 20);
	ListPushFront(plist, 30);
	ListPushFront(plist, 40);
	ListPrint(plist);
	//尾删
	ListPopBack(plist);
	ListPopBack(plist);
	ListPopBack(plist);
	ListPopBack(plist);
	ListPrint(plist);

	//头删
	ListPopFront(plist);
	ListPopFront(plist);
	ListPopFront(plist);
	ListPrint(plist);

}

void TestList2()
{
	LTNode* plist = ListInit();
	ListPushBack(plist, 1);
	ListPushBack(plist, 2);
	ListPushBack(plist, 3);
	ListPushBack(plist, 4);
	ListPrint(plist);

	ListPopFront(plist);
	ListPopFront(plist);
	ListPrint(plist);

	ListPopFront(plist);
	ListPopFront(plist);
	ListPrint(plist);

	ListDestory(plist);
	plist = NULL;
}

void TestList3()
{
	LTNode* plist = ListInit();
	ListPushBack(plist, 1);
	ListPushBack(plist, 2);
	ListPushBack(plist, 3);
	ListPushBack(plist, 4);
	ListPrint(plist);

}
int main()
{
	//TestList3();
	//TestList3();
	TestList2();

	return 0;
}
Srtive
关注
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值