数据结构之带头双向循环链表（C语言）

带头双向循环链表：结构最复杂，一般用在单独存储数据。实际中使用的链表数据结构，都是带头双向循环链表。另外这个结构虽然结构复杂，但是使用代码实现以后会发现结构会带来很多优势，实现反而简单了，后面我们代码实现了就知道了。

1. 双向链表的实现

1.1 初始化

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

1.2 新节点的创建

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

1.3 尾插

void LTPushBack(LTNode* phead, LTDataType x)
{
	//有哨兵位需要断言
	assert(phead);
	//基本方法
	LTNode* newnode = BuyListNode(x);
	LTNode* tail = phead->prev;

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

	//位置插入方法
	//LTInsert(phead, x);
}

1.4 尾删

void LTPopBack(LTNode* phead)
{
	assert(phead);
	assert(!LTEmpty(phead));
	//直接方法
	LTNode* tail = phead->prev;
	LTNode* tailprev = tail->prev;
	tailprev->next = phead;
	phead->prev = tailprev;
	free(tail);
	tail = NULL;
	//位置删除方法
	//LTErase(phead->prev);
}

1.5 头插

void LTPushFront(LTNode* phead, LTDataType x)
{
	assert(phead);
	//基本插入
	LTNode* newnode = BuyListNode(x);
	LTNode* next = phead->next;
	newnode->next = next;
	next->prev = newnode;
	phead->next = newnode;
	newnode->prev = phead;
	//位置插入
	//LTInsert(phead->next, x);
}

1.6 头删

void LTPopFront(LTNode* phead)
{
	assert(phead);
	assert(!LTEmpty(phead));
	//基本删除
	LTNode* frist = phead->next;
	phead->next = frist->next;
	frist->next->prev = phead;
	free(frist);
	frist = NULL;
	//位置删除
	//LTErase(phead->next);
}

1.7 在pos位置前插入

void LTInsert(LTNode* pos, LTDataType x)
{
	assert(pos);
	LTNode* newnode = BuyListNode(x);
	LTNode* prev = pos->prev;

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

1.8 在pos位置删除

void LTErase(LTNode* pos)
{
	assert(pos);
	pos->prev->next = pos->next;
	pos->next->prev = pos->prev;
	free(pos);
	//pos = NULL;(形参的改变不影响实参)
}

1.9 双向链表查找

LTNode* ListFind(LTNode* phead, LTDataType x)
{
	assert(phead);
	LTNode* pos = phead->next;
	while (pos!=phead)
	{
		if (pos->date == x)
		{
			return pos;
		}
		pos = pos->next;
	}
	return NULL;
}

1.10 双向链表的打印

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

1.11 销毁

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

2. 源代码

2.1 List.h

#pragma once
#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#include<stdbool.h>
typedef int LTDataType;

typedef struct ListNode
{
	struct ListNode* prev;
	struct ListNode* next;
	LTDataType date;
}LTNode;

LTNode* LTInit();//初始化

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

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

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

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

bool LTEmpty(LTNode* phead);//判断是否为空链表

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

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

LTNode* ListFind(LTNode* phead, LTDataType x);// 双向链表查找

void LTInsert(LTNode* pos, LTDataType x);//在pos位置前插入

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

2.2 List.c

#define  _CRT_SECURE_NO_WARNINGS 1
#include"List.h"

LTNode* BuyListNode(LTDataType x)
{
	LTNode* newnode = (LTNode*)malloc(sizeof(LTNode));
	if (newnode == NULL)
	{
		perror("BuyListNode::malloc");
		return NULL;
	}
	newnode->date = x;
	newnode->next = NULL;
	newnode->prev = NULL;
	return newnode;
}
//初始化
LTNode* LTInit()
{
	LTNode* phead = BuyListNode(-1);
	phead->next = phead;
	phead->prev = phead;
	return phead;
}

//打印
void LTPrint(LTNode* phead)
{
	assert(phead);
	printf("<=head");
	LTNode* cur = phead->next;
	while (cur != phead)
	{
		printf("<=%d=>", cur->date);
		cur = cur->next;
	}
	printf("\n");
}

//尾插
void LTPushBack(LTNode* phead, LTDataType x)
{
	//有哨兵位需要断言
	assert(phead);
	//基本方法
	LTNode* newnode = BuyListNode(x);
	LTNode* tail = phead->prev;

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

	//位置插入方法
	//LTInsert(phead, x);
}

//判断是否为空链表
bool LTEmpty(LTNode* phead)
{
	assert(phead);
	return phead->next == phead;
}

//尾删
void LTPopBack(LTNode* phead)
{
	assert(phead);
	assert(!LTEmpty(phead));
	//直接方法
	LTNode* tail = phead->prev;
	LTNode* tailprev = tail->prev;
	tailprev->next = phead;
	phead->prev = tailprev;
	free(tail);
	tail = NULL;
	//位置删除方法
	//LTErase(phead->prev);
}

//头插
void LTPushFront(LTNode* phead, LTDataType x)
{
	assert(phead);
	//基本插入
	LTNode* newnode = BuyListNode(x);
	LTNode* next = phead->next;
	newnode->next = next;
	next->prev = newnode;
	phead->next = newnode;
	newnode->prev = phead;
	//位置插入
	//LTInsert(phead->next, x);
}

//头删
void LTPopFront(LTNode* phead)
{
	assert(phead);
	assert(!LTEmpty(phead));
	//基本删除
	LTNode* frist = phead->next;
	phead->next = frist->next;
	frist->next->prev = phead;
	free(frist);
	frist = NULL;
	//位置删除
	//LTErase(phead->next);
}

//在pos位置前插入
void LTInsert(LTNode* pos, LTDataType x)
{
	assert(pos);
	LTNode* newnode = BuyListNode(x);
	LTNode* prev = pos->prev;

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

//在pos位置删除
void LTErase(LTNode* pos)
{
	assert(pos);
	pos->prev->next = pos->next;
	pos->next->prev = pos->prev;
	free(pos);
	//pos = NULL;(形参的改变不影响实参)
}

// 双向链表查找
LTNode* ListFind(LTNode* phead, LTDataType x)
{
	assert(phead);
	LTNode* pos = phead->next;
	while (pos!=phead)
	{
		if (pos->date == x)
		{
			return pos;
		}
		pos = pos->next;
	}
	return NULL;
}

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

2.3 test.c

#define  _CRT_SECURE_NO_WARNINGS 1
#include"List.h"

void ListTest1()
{
	LTNode* plist = LTInit();
	//尾插
	LTPushBack(plist, 1);
	LTPushBack(plist, 2);
	LTPrint(plist);
	//尾删
	LTPopBack(plist);
	LTPrint(plist);
	//LTPopBack(plist);
	//LTPrint(plist);
	//头插
	LTPushFront(plist, 2);
	LTPrint(plist);
	//头删
	LTPopFront(plist);
	LTPrint(plist);
	//LTPopFront(plist);
	//LTPrint(plist);

}
int main()
{
	ListTest1();
	return 0;
}