带头结点的双向循环链表的基本操作

定义与声明

typedef int DataType;


typedef struct DListNode
{
	DataType data;
	struct DListNode* Pre;
	struct DListNode* Next;
}Node;

void DListInit(Node** pHead);//初始化
void DListPushBack(Node* p, DataType data);//尾插
void DListPopBack(Node* p);//尾删
void DListPushFront(Node* p, DataType data);//头插
void DListPopFront(Node* p);//头删
void DListInsert(Node* pos,DataType data);//在pos地址结点之前插入新的值为data的结点
Node* DListFind(Node* p,DataType data);//找到值为data的结点返回结点的地址，没有返回NULL
void DListErase(Node* pos);//删除pos地址的结点
void DListRemove(Node* p, DataType data);//删除链表中值为data的第一个结点
void DListRemoveAll(Node* p, DataType data);//删除链表中所有值为data结点
void ListDestory(Node** p);//销毁链表

函数实现

#include"DList.h"
Node* BuyNewNode(DataType data)
{
	Node* NewNode = (Node*)malloc(sizeof(Node));
	if (NULL == NewNode)
	{
		assert(0);
		return NULL;
	}
	NewNode->Pre = NULL;
	NewNode->Next = NULL;
	NewNode->data = data;
	return NewNode;
}
void DListInit(Node** pHead)
{
	assert(pHead);
	Node* New = BuyNewNode(0);
	New->Next = New;
	New->Pre = New;
	*pHead = New;
}
void DListPushBack(Node* p, DataType data)
{
	assert(p);
	Node* NewNode = BuyNewNode(data);
	NewNode->Next = p;
	NewNode->Pre = p->Pre;
	p->Pre->Next = NewNode;
	p->Pre = NewNode;

}
void DListPopBack(Node* p)
{
	assert(p);
	if (p->Next == p)
	{
		return;
	}
	else
	{
		p->Pre = p->Pre->Pre;
		free(p->Pre->Next);
		p->Pre->Next = p;
	}
}
void DListPushFront(Node* p, DataType data)
{
	assert(p);
	Node* NewNode = BuyNewNode(data);
	NewNode->Next = p->Next;
	NewNode->Pre = p;
	p->Next->Pre = NewNode;
	p->Next = NewNode;
}
void DListPopFront(Node* p)
{
	assert(p);
	Node* Del = p->Next;
	p->Next->Next->Pre = p;
	p->Next = p->Next->Next;
	free(Del);
	Del = NULL;
}
Node* DListFind(Node* p,DataType data)
{
	assert(p);
	Node* cur = p->Next;
	while (cur != p)
	{
		if (cur->data == data)
		{
			return cur;
		}
		cur = cur->Next;
	}
	return NULL;
}
void DListInsert(Node* pos, DataType data)
{
	assert(pos);
	Node* NewNode = BuyNewNode(data);
	NewNode->Next = pos;
	NewNode->Pre = pos->Pre;
	pos->Pre->Next = NewNode;
	pos->Pre = NewNode;
}
void DListErase(Node* pos)
{
	assert(pos);
	pos->Next->Pre = pos->Pre;
	pos->Pre->Next = pos->Next;
	free(pos);
	pos = NULL;
}
void DListRemove(Node* p, DataType data)
{
	assert(p);
	Node *cur = p->Next;
	while (cur->Next!=p)
	{
		if (cur->data == data)
		{
			break;
		}
		cur = cur->Next;
	}
	cur->Next->Pre = cur->Pre;
	cur->Pre->Next = cur->Next;
	free(cur);
	cur = NULL;
}
void DListRemoveAll(Node* p, DataType data)
{
	assert(p);
	Node* pos = p->Next;
	while (pos != p)
	{
		if (pos->data == data)
		{
			Node* cur = pos;
			pos = pos->Next;

			cur->Next->Pre = cur->Pre;
			cur->Pre->Next = cur->Next;
			free(cur);
		}
		else
		{
			pos = pos->Next;
		}
	}
}
void ListDestory(Node** p)
{
	assert(p);
	Node* cur = *p;
	cur = cur->Next;
	while (cur != *p)
	{
		Node* pos = cur;
		cur = cur->Next;
		free(pos);
	}
	free(*p);
	*p = NULL;
}