数据结构 —— 链表之带头双向循环链表

相关概念

带头双向循环链表是结构最复杂的链表，也是实际应用中最常使用的链表。虽然带头双向循环链表的结构复杂，但是其复杂的结构反而带来了功能实现上的巨大便利性，解决了单链表许多的不足之处。

带头双向循环链表的常用接口:

带头双向循环链表的定义

typedef int LTDataType;
typedef struct ListNode
{
	LTDataType data;
	struct ListNode* prev; //双向，所以前后结点指针都包含
	struct ListNode* next;
}LTNode;

新建结点

LTNode* BuyListNode(LTDataType x)
{
	LTNode* node = (LTNode*)malloc(sizeof(LTNode));//申请空间，建立结点
	if (node == NULL)
	{
		perror("malloc fail");
		exit(1);
	}
	node->prev = NULL;
	node->next = NULL;
	node->data = x;

	return node;
}

初始化

LTNode* LTInit()
{
	LTNode* phead = BuyListNode(-1);
	phead->prev = phead;  //循环，所以哨兵头前后结点都指向自身
	phead->next = phead;

	return phead;
}

链表销毁

void LTDestroy(LTNode* phead)
{
	assert(phead);

	LTNode* cur = phead->next;
	while (cur != phead)  //链表循环，所以回到哨兵头结点为结束标志
	{
		LTNode* next = cur->next;
		free(cur);
		cur = next;
	}

	free(phead);
}

判断链表是否为空

bool LTEmpty(LTNode* phead)
{
	assert(phead);
	//链表只有哨兵位时为空
	return phead->next == phead;
}

尾插

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;
}

尾删

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;
}

头插

void LTPushFront(LTNode* phead, LTDataType x)
{
	assert(phead);

	LTNode* newnode = BuyListNode(x);
	LTNode* first = phead->next;  //先找到原头结点，储存起来

	phead->next = newnode;
	newnode->prev = phead;
	newnode->next = first;
	first->prev = newnode;
}

头删

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

	LTNode* first = phead->next;  //存好原头结点
	phead->next = first->next;
	first->next->prev = phead;

	free(first);
	first = NULL;
}

结点查找

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;
}

任意位前插入

void LTInsert(LTNode* pos, LTDataType x)
{
	assert(pos);

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

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

任意位置删除

void LTErase(LTNode* pos)
{
	assert(pos);

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

	free(pos);
}

That’s all, let’s move on to the next knowledge point!