循环双向带头链表

        链表简介

一、DList.h

#pragma once
#pragma once
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<stdbool.h>
// 带头+双向+循环链表增删查改实现
typedef int LTDataType;
typedef struct ListNode
{
	LTDataType _data;
	struct ListNode* _next;
	struct ListNode* _prev;
}ListNode;

// 创建返回链表的头结点.
ListNode* ListCreate();
// 双向链表销毁
void ListDestory(ListNode* pHead);
// 双向链表打印
void ListPrint(ListNode* pHead);
// 双向链表尾插
void ListPushBack(ListNode* pHead, LTDataType x);
// 双向链表尾删
void ListPopBack(ListNode* pHead);
// 双向链表头插
void ListPushFront(ListNode* pHead, LTDataType x);
// 双向链表头删
void ListPopFront(ListNode* pHead);
// 双向链表查找
ListNode* ListFind(ListNode* pHead, LTDataType x);
// 双向链表在pos的前面进行插入
void ListInsert(ListNode* pos, LTDataType x);
// 双向链表删除pos位置的节点
void ListErase(ListNode* pos);

二、DList.c 

        此部分函数内注释的代码均为不使用任意位置插入、删除的函数

#include"DList.h"

// 创建返回链表的头结点.
ListNode* BuyNewNode(LTDataType x)
{
	ListNode* newnode = (ListNode*)malloc(sizeof(ListNode));
	if (NULL == newnode)
	{
		perror("BuyNode malloc fail!");
		return NULL;
	}
	newnode->_next = NULL;
	newnode->_prev = NULL;
	newnode->_data = x;
	return newnode;
}

bool LTEmpty(ListNode* phead)
{
	assert(phead);

	return phead->_next == phead;
}

ListNode* ListCreate()
{
	ListNode* guard = BuyNewNode(-1);
	guard->_next = guard;
	guard->_prev = guard;
	return guard;
}

// 双向链表打印
void ListPrint(ListNode* pHead)
{
	ListNode* cur = pHead->_next;
	printf("Phead<=>");
	while (cur != pHead)
	{
		printf("%d<=>", cur->_data);
		cur = cur->_next;
	}
	printf("\n");
}
// 双向链表尾插
void ListPushBack(ListNode* pHead, LTDataType x)
{
	assert(pHead);
	/*ListNode* newnode = BuyNewNode(x);

	newnode->_next = pHead;
	newnode->_prev = pHead->_prev;
	pHead->_prev->_next = newnode;
	pHead->_prev = newnode;*/
	ListInsert(pHead, x);
}

// 双向链表尾删
void ListPopBack(ListNode* pHead)
{
	assert(pHead);
	assert(!LTEmpty(pHead));
	/*ListNode* del = pHead->_prev;

	pHead->_prev = del->_prev;
	del->_prev->_next = pHead;
	free(del);*/

	ListErase(pHead->_prev);
}
// 双向链表头插
void ListPushFront(ListNode* pHead, LTDataType x)
{
	/*assert(pHead);
	ListNode* newnode = BuyNewNode(x);
	ListNode* first = pHead->_next;

	newnode->_prev = pHead;
	newnode->_next = first;
	first->_prev = newnode;
	pHead->_next = newnode;*/
	ListInsert(pHead->_next, x);
}
// 双向链表头删
void ListPopFront(ListNode* pHead)
{
	assert(pHead);
	assert(!LTEmpty(pHead));
	/*ListNode* first = pHead->_next;

	pHead->_next = first->_next;
	first->_next->_prev = pHead;
	free(first);*/
	ListErase(pHead->_next);
}
//双向链表查找
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;
}
// 双向链表在pos的前面进行插入
void ListInsert(ListNode* pos, LTDataType x)
{
	assert(pos);
	ListNode* newnode = BuyNewNode(x);

	newnode->_next = pos;
	newnode->_prev = pos->_prev;
	pos->_prev->_next = newnode;
	pos->_prev = newnode;
}
// 双向链表删除pos位置的节点
void ListErase(ListNode* pos)
{
	assert(pos);
	ListNode* del = pos;
	del->_prev->_next = del->_next;
	del->_next->_prev = del->_prev;
	free(pos);
}
//双向链表销毁
void ListDestory(ListNode* pHead)
{
	assert(pHead);
	ListNode* cur = pHead->_next;
	while (cur != pHead)
	{
		ListNode* next = cur->_next;
		free(cur);
		cur = next;
	}
	free(pHead);
}

三 、test.c

#include"DList.h"
//尾插测试,
void test1()
{
	ListNode* plist = ListCreate();
	ListPushBack(plist, 1);
	ListPushBack(plist, 2);
	ListPushBack(plist, 3);
	ListPushBack(plist, 4);
	ListPushBack(plist, 5);
	ListPrint(plist);
	ListPopBack(plist);
	ListPrint(plist);
	ListPopBack(plist);
	ListPrint(plist);
	ListPopBack(plist);
	ListPrint(plist);
	ListPopBack(plist);
	ListPrint(plist);
	ListPopBack(plist);
	ListPrint(plist);
	/*ListNode* pos = ListFind(plist, 3);
	ListInsert(pos, 30);
	ListPrint(plist);
	ListInsert(plist->_next, -1);
	ListPrint(plist);
	pos = ListFind(plist, 30);
	ListErase(pos);
	ListPrint(plist);*/
}
void test2()
{
	ListNode* plist = ListCreate();
	ListPushFront(plist, 1);
	ListPushFront(plist, 2);
	ListPushFront(plist, 3);
	ListPushFront(plist, 4);
	ListPrint(plist);
	ListPopFront(plist);
	ListPrint(plist);
	ListPopFront(plist);
	ListPrint(plist);
	
}

int main()
{

	test1();
	//test2();
	return 0;
}