数据结构-双向循环链表（带哨兵位）

最新推荐文章于 2023-10-02 10:34:47 发布

φ冰霰ξ

最新推荐文章于 2023-10-02 10:34:47 发布

阅读量157

点赞数 2

文章标签： c语言数据结构学习

本文链接：https://blog.csdn.net/weixin_72501602/article/details/130632270

版权

目录

前言

代码分析

数据类型

动态申请一个结点

带头双向循环链表初始化

带头双向循环链表打印

带头双向循环链表的尾插

带头双向循环链表的头插

带头双向循环链表的尾删

带头双向循环链表的头删

带头双向循环链表的查找

带头双向循环链表在pos之前插入x

带头双向循环链表删除pos位置的值

带头双向循环链表的销毁

完整代码

List.h

List.c

Test.

学习带头双向循环链表之前：哨兵位？双向？循环？buff越多链表越难？

学习带头双向循环链表之后：带头双向循环链表赛高！！！单链表再见！

前言

编译环境：VS2022

编程语言：C

内存管理（动态/静态）：动态内存管理

是否带哨兵位：是

链表类型：双向循环链表

代码分析

数据类型

typedef struct ListNode
{
	LTDataType data;    //数据域
	struct ListNode* prev;    //指向前一个结点
	struct ListNode* next;    //指向后一个结点
}LTNode;

动态申请一个结点

LTNode* BuyLTNode(LTDataType x)
{
	LTNode* newnode = (LTNode*)malloc(sizeof(LTNode));
    //考虑申请空间失败的情况
	if (newnode == NULL)
	{
		perror("malloc");
		return NULL;
	}
	newnode->data = x;
	newnode->prev = NULL;
	newnode->next = NULL;
	return newnode;
}

带头双向循环链表初始化

初始化需要申请一个结点设置哨兵位

LTNode* LTInit()
{
	//此处哨兵位的数据域(data)随便存放一个LTDataType类型的数据即可
    //如果data的数据类型为int，我们也可以用哨兵位的数据域来存放链表的长度
    LTNode* phead = BuyLTNode(-1);
	phead->next = phead;
	phead->prev = phead;
	return phead;
}

带头双向循环链表打印

void LTPrint(LTNode* phead)
{
	assert(phead);
    //如何不遗漏不重复地打印一遍双向循环链表呢？
	LTNode* cur = phead->next;
	printf("guard<=>");
	while (cur != phead)
	{
		printf("%d<=>", cur->data);
		cur = cur->next;
	}
	printf("\n");
}

带头双向循环链表的尾插

建议在插入和删除的时候不要吝啬开辟新的空间
创建两个新的结构体指针能够提高代码的可读性，计算机不缺这点内存

void LTPushBack(LTNode* phead, LTDataType x)
{
	assert(phead);
	LTNode* newnode = BuyLTNode(x);
	LTNode* tail = phead->prev;
    //下面四条语句的顺序可以随意交换吗？
	tail->next = newnode;
	phead->prev = newnode;
	newnode->next = phead;
	newnode->prev = tail;
}

//但是我们也需要能够看懂别人的代码
尝试只创建一个结构体指针完成上述操作

带头双向循环链表的头插

带头双向循环链表的插入(包括头插、尾插)和删除(包括头删、尾删)极具相似性

void LTPushFront(LTNode* phead, LTDataType x)
{
	assert(phead);
	LTNode* newnode = BuyLTNode(x);
	LTNode* next = phead->next;
	phead->next = newnode;
	next->prev = newnode;
	newnode->next = next;
	newnode->prev = phead;
}

带头双向循环链表的尾删

void LTPopBack(LTNode* phead)
{
	assert(phead);
	assert(!LTEmpty(phead));
	
	LTNode* tail = phead->prev;
	LTNode* tailPrev = tail->prev;

	phead->prev = tailPrev;
	tailPrev->next = phead;
	free(tail);
}

带头双向循环链表的头删

void LTPopFront(LTNode* phead)
{
	assert(phead);
	assert(!LTEmpty(phead));

	LTNode* first = phead->next;
	LTNode* second = first->next;

	phead->next = second;
	second->prev = phead;
	free(first);
}

带头双向循环链表的查找

LTNode* LTFind(LTNode* phead, LTDataType x)
{
	assert(phead);
    //遍历
	LTNode* cur = phead->next;
	while (cur != phead)
	{
		if (cur->data == x)
			return cur;
		cur = cur->next;
	}
	return NULL;
}

带头双向循环链表在pos之前插入x

// 在pos之前插入

void LTInsert(LTNode* pos, LTDataType x)
{
	assert(pos);
    //试分析一下，头插、尾插的情况是否被包含在内

	LTNode* prev = pos->prev;
	LTNode* newnode = BuyLTNode(x);

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

带头双向循环链表删除pos位置的值

// 删除pos位置的值
void LTErase(LTNode* pos)
{
	assert(pos);
    //试分析一下，头删、尾删的情况是否被包含在内

	LTNode* prev = pos->prev;
	LTNode* next = pos->next;

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

带头双向循环链表的销毁

void LTDestroy(LTNode* phead)
{
	assert(phead);
    //遍历
	LTNode* cur = phead->next;
	while (cur != phead)
	{
		LTNode* next = cur->next;
		free(cur);
		cur = next;
	}
	free(phead);
    //此处是否需要置空哨兵位phead呢？
    //形参的改变不会影响实参，还是交给链表的使用者置空吧
}

完整代码

List.h

#pragma once

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

typedef int LTDataType;
typedef struct ListNode
{
	LTDataType data;
	struct ListNode* prev;
	struct ListNode* next;
}LTNode;

LTNode* LTInit();
void LTPrint(LTNode* phead);

bool LTEmpty(LTNode* phead);
void LTPushBack(LTNode* phead, LTDataType x);
void LTPushFront(LTNode* phead, LTDataType x);
void LTPopBack(LTNode* phead);
void LTPopFront(LTNode* phead);

LTNode* LTFind(LTNode* phead, LTDataType x);

// 在pos之前插入
void LTInsert(LTNode* pos, LTDataType x);
// 删除pos位置的值
void LTErase(LTNode* pos);
void LTDestroy(LTNode* phead);

List.c

#include "List.h"

LTNode* BuyLTNode(LTDataType x)
{
	LTNode* newnode = (LTNode*)malloc(sizeof(LTNode));
	if (newnode == NULL)
	{
		perror("malloc");
		return NULL;
	}
	newnode->data = x;
	newnode->prev = NULL;
	newnode->next = NULL;
	return newnode;
}

LTNode* LTInit()
{
	LTNode* phead = BuyLTNode(-1);
	phead->next = phead;
	phead->prev = phead;
	return phead;
}

void LTPrint(LTNode* phead)
{
	assert(phead);
	LTNode* cur = phead->next;
	printf("guard<=>");
	while (cur != phead)
	{
		printf("%d<=>", cur->data);
		cur = cur->next;
	}
	printf("\n");
}


bool LTEmpty(LTNode* phead)
{
	return phead->next == phead;
}

void LTPushBack(LTNode* phead, LTDataType x)
{
	assert(phead);
	LTNode* newnode = BuyLTNode(x);
	LTNode* tail = phead->prev;
	tail->next = newnode;
	phead->prev = newnode;
	newnode->next = phead;
	newnode->prev = tail;
}

void LTPushFront(LTNode* phead, LTDataType x)
{
	assert(phead);
	LTNode* newnode = BuyLTNode(x);
	LTNode* next = phead->next;
	phead->next = newnode;
	next->prev = newnode;
	newnode->next = next;
	newnode->prev = phead;
}

void LTPopBack(LTNode* phead)
{
	assert(phead);
	assert(!LTEmpty(phead));
	
	LTNode* tail = phead->prev;
	LTNode* tailPrev = tail->prev;
	phead->prev = tailPrev;
	tailPrev->next = phead;
	free(tail);
}

void LTPopFront(LTNode* phead)
{
	assert(phead);
	assert(!LTEmpty(phead));

	LTNode* first = phead->next;
	LTNode* second = first->next;
	phead->next = second;
	second->prev = phead;
	free(first);
}

LTNode* LTFind(LTNode* phead, LTDataType x)
{
	assert(phead);

	LTNode* cur = phead->next;
	while (cur != phead)
	{
		if (cur->data == x)
			return cur;
		cur = cur->next;
	}
	return NULL;
}

// 在pos之前插入
void LTInsert(LTNode* pos, LTDataType x)
{
	assert(pos);

	LTNode* prev = pos->prev;
	LTNode* newnode = BuyLTNode(x);
	newnode->next = pos;
	newnode->prev = prev;
	prev->next = newnode;
	pos->prev = newnode;
}

// 删除pos位置的值
void LTErase(LTNode* pos)
{
	assert(pos);
	LTNode* prev = pos->prev;
	LTNode* next = pos->next;
	prev->next = next;
	next->prev = prev;
	free(pos);
}

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

Test.c

#include "List.h"

void TestList1()
{
	LTNode* plist = LTInit();
	LTPushBack(plist, 1);
	LTPushBack(plist, 2);
	LTPushBack(plist, 3);
	LTPushBack(plist, 4);

	LTPrint(plist);

	LTPopBack(plist);
	LTPrint(plist);

	LTPopBack(plist);
	LTPrint(plist);

	LTPopBack(plist);
	LTPrint(plist);

	LTPopBack(plist);
	LTPrint(plist);

	//LTPopBack(plist);
	//LTPrint(plist);

	LTDestroy(plist);
	plist = NULL;
}

void TestList2()
{
	LTNode* plist = LTInit();
	LTPushFront(plist, 5);
	LTPushFront(plist, 6);
	LTPushFront(plist, 7);
	LTPushFront(plist, 8);
	LTPrint(plist);

	LTPopFront(plist);
	LTPrint(plist);

	LTPopFront(plist);
	LTPrint(plist);

	LTPopFront(plist);
	LTPrint(plist);

	LTPopFront(plist);
	LTPrint(plist);

	/*LTPopFront(plist);
	LTPrint(plist);*/

	LTDestroy(plist);
	plist = NULL;
}

void TestList3()
{
	LTNode* plist = LTInit();
	LTPushFront(plist, 1);
	LTPushFront(plist, 3);
	LTPushFront(plist, 5);
	LTPushFront(plist, 7);
	LTPrint(plist);

	LTNode* pos = LTFind(plist, 3);
	if (pos)
	{
		LTInsert(pos, 2);
	}
	LTPrint(plist);

	LTDestroy(plist);
	plist = NULL;
}

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

	return 0;
}