双链表的增删查改（C语言版本）

前言

本篇文章我将会向大家介绍数据结构中一种常用的链表结构，：带头双向循环链表（双链表）。
我将会介绍双链表的以下功能：初始化、打印、尾插、尾删、头插、头删、查找、任意位置前插入、删除任意位置，销毁。每一个功能我都会向大家展示相应的效果，并且分析它就是如何来实现的，下面开始介绍。

1.双链表的存储

定义一个双链表结点：双链表结点有三个成员，一个变量存放该结点数据，还有两个指针一个指向上一个结点，一个指向下一个结点。

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

2.申请新结点

ListNode* ListCreate(LTDataType x)
{
	ListNode* node = (ListNode*)malloc(sizeof(ListNode));
	node->next = NULL;
	node->prev = NULL;
	node->data = x;

	return node;
}

3.双链表的初始化

ListNode* ListInit()
{
	ListNode* phead = BuyListNode(0);
	phead->_next = phead;
	phead->_prev = phead;

	return phead;
}

4.双链表的打印

void ListPrint(ListNode* phead)
{
	assert(phead);
	ListNode* cur = phead->next;
	while (cur != phead)
	{
		printf("%d ", cur->data);
		cur = cur->next;
	}

	printf("\n");
}

5.双链表的尾插

void ListPushBack(ListNode* phead, LTDataType x)
{
	assert(phead);

	ListNode* tail = phead->prev;
	ListNode* newnode = BuyListNode(x);
	
	tail->next = newnode;
	newnode->prev = tail;

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

6.双链表的尾删

void ListPopBack(ListNode* phead)
{
	assert(phead);
	assert(phead->next != phead);

	ListNode* tail = phead->prev;
	ListNode* tailPrev = tail->prev;

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

7.双链表的头插

void ListPushFront(ListNode* phead, LTDataType x)
{
	assert(phead);

	ListNode* first = phead->next;
	ListNode* newnode = BuyListNode(x);

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

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

8.双链表的头删

void ListPopFront(ListNode* phead)
{
	assert(phead);
	assert(phead->next != phead);

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

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

	free(first);
}

9.双链表的查找

ListNode* ListFind(ListNode* phead, LTDataType x)
{
	assert(phead);
	ListNode* cur = phead->next;
	while (cur != phead)
	{
		if (cur->data == x)
			return cur;

		cur = cur->next;
	}

	return NULL;

}

10.双链表在任意位置前插入

void ListInsert(ListNode* pos, LTDataType x)
{
	assert(pos);
	ListNode* posPrev = pos->prev;
	ListNode* newnode = BuyListNode(x);

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

11.双链表删除任意位置

void ListErase(ListNode* pos)
{
	assert(pos);
	ListNode* posPrev = pos->prev;
	ListNode* posNext = pos->next;

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

12.双链表的销毁

void ListDestory(ListNode** pphead)
{
	assert(*pphead);
	ListNode* cur = *pphead;
	while (cur != *pphead)
	{
		ListNode* next = cur->next;
		free(cur);
		cur = next;
	}

	free(*pphead);
	*pphead = NULL;
}