带头节点的双向循环链表的实现

#pragma once
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <malloc.h>
typedef int DataType;
typedef struct ListNode
{
	DataType data;
	struct ListNode* next;
	struct ListNode* prev;
} ListNode;
ListNode *ListInitList();  //创建链表并返回头节点
ListNode *BuyNode(DataType x);  //创建新的节点
void ListPrintList(ListNode *PList);  //打印链表
void ListPushBack(ListNode *PList, DataType x);  //尾插
void ListPushFront(ListNode *PList, DataType x);  //头插
void ListPopBack(ListNode* PList);//尾删
void ListPopfront(ListNode* PList);//头删
ListNode* ListFindList(ListNode* PList, DataType x);//查找并返回该节点
void ListInsert(ListNode* pos, DataType x);//在pos前插入
void ListErase(ListNode* pos);//删除pos位置的节点
void DeleteList(ListNode* PList);//删除链表

#include"DHCL.h"
ListNode* ListInitList()//创建链表并返回头结点
{
	DataType x = 0;
	ListNode* head = BuyNode(x);
	head->next = head;
	head->prev = head;
	return head;
}
ListNode *BuyNode(DataType x) //创建新的节点
{
	ListNode* newnode = (ListNode*)malloc(sizeof(ListNode));
	if (newnode == NULL)//未开辟成功
		return NULL;
	newnode->data = x;
	newnode->next = NULL;
	newnode->prev = NULL;
	return newnode;
}
void ListPrintList(ListNode *PList) //打印链表
{
	assert(PList);
	ListNode* cur = PList->next;//从链表的下一个节点开始打印，否则无法判断链表结束
	while (cur != PList)
	{
		printf("%d -> ", cur->data);
		cur = cur->next;
	}
	printf("N\n");
}
void ListPushBack(ListNode *PList, DataType x)  //尾插
{
	ListNode *head = PList;
	ListNode *tail = head->prev;
	ListNode *newnode = BuyNode(x);
	tail->next = newnode;
	newnode->prev = tail;
	newnode->next = head;
	head->prev = newnode;
}
void ListPushFront(ListNode *PList, DataType x)  //头插
{
	ListNode *first = PList->next;
	ListNode *newnode = BuyNode(x);
	PList->next = newnode;
	newnode->prev = PList;
	newnode->next = first;
	first->prev = newnode;
}
void ListPopBack(ListNode *PList)  //尾删
{
	ListNode *tail = NULL;
	ListNode *prev = NULL;
	assert(PList&&PList->next != NULL);
	ListErase(PList->prev);
	/*tail = plist->prev;
	prev = tail->prev;
	plist->prev = prev;
	prev->next = plist;
	free(tail);
	tail = NULL; */
}
void ListPopFront(ListNode *PList)  //头删
{
	ListNode *first = NULL;
	ListNode *next = NULL;
	assert(PList&&PList->next != NULL);
	ListErase(PList->next);
	/*first = plist->next;
	next = first->next;
	plist->next = next;
	next->prev = plist;
	free(first);
	first = NULL;*/
}
ListNode *ListFindList(ListNode *PList, DataType x)  //查找并返回该节点
{
	ListNode *cur = NULL;
	assert(PList);
	cur = PList->next;
	while (cur != PList)
	{
		if (cur->data == x)
			return cur;
		cur = cur->next;
	}
	return NULL;
}
void ListInsert(ListNode *pos, DataType x)  //在pos节点前插入
{
	ListNode *newnode = NULL;
	ListNode *prev = NULL;
	assert(pos);
	prev = pos->prev;
	newnode = BuyNode(x);
	prev->next = newnode;
	newnode->prev = prev;
	newnode->next = pos;
}
void ListErase(ListNode *pos)  //删除pos位置的节点
{
	ListNode *prev = NULL;
	ListNode *next = NULL;
	assert(pos);
	prev = pos->prev;
	next = pos->next;
	prev->next = next;
	next->prev = prev;
	free(pos);
	pos = NULL;
}
void DeleteList(ListNode *PList)  //删除链表
{
	assert(PList);
	ListNode *cur = PList->next;
	ListNode *next = NULL;
	while (cur != PList)
	{
		next = cur->next;
		free(cur);
		cur = NULL;
		cur = next;
	}
} 

#include "DHCL.h"
void text()
{
	ListNode *plist = ListInitList();
	ListPushBack(plist, 1);
	ListPushBack(plist, 2);
	ListPushBack(plist, 3);
	ListPushBack(plist, 4);  //尾插1,2,3,4 
	ListPushFront(plist, 1);
	ListPushFront(plist, 2);
	ListPushFront(plist, 3);
	ListPushFront(plist, 4);  //头插1,2,3,4
	ListPrintList(plist);  //4->3->2->1->1->2->3->4->NULL
	ListNode *pos1 = ListFindList(plist, 3);
	if (pos1 == NULL)
		printf("pos1没找到\n");
	else
		printf("pos1找到了: %d\n", pos1->data);
	ListNode *pos2 = ListFindList(plist, 5);
	if (pos2 == NULL)
		printf("pos2没找到\n");
	else
		printf("pos2找到了: %d\n", pos2->data);
	ListPopBack(plist);  //尾删
	ListPrintList(plist);  //4->3->2->1->1->2->3->NULL
	ListPopBack(plist);
	ListPrintList(plist);  //4->3->2->1->1->2->NULL
	ListPopFront(plist);  //头删
	ListPrintList(plist);      //3->2->1->1->2->NULL
	ListNode *pos = ListFindList(plist, 3);
	if (pos == NULL)
		printf("没找到\n");
	else
	{
		ListInsert(pos, 4);
		ListPrintList(plist);  //4->3->2->1->1->2->NULL
		ListErase(pos);
		ListPrintList(plist);  //4->2->1->1->2->NULL
	}
	DeleteList(plist);
}
int main()
{
	text();
	system("pause");
	return 0;
}