数据结构5：双链表的实现

头文件

List.h

#pragma once

#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<stdbool.h>

typedef int LDataType;

typedef struct ListNode {
	LDataType val;
	struct ListNode* prev;
	struct ListNode* next;
}ListNode;

//链表打印
void ListPrint(ListNode* phead);

//初始化
ListNode* LTInit();

//销毁
void LTDestroy(ListNode* phead);

//判断链表是否为空
bool LTEmpty(ListNode* phead);

//尾插
void LTPushBack(ListNode* phead, LDataType x);

//头插
void LTPushFront(ListNode* phead, LDataType x);

//尾删
void LTPopBack(ListNode* phead);

//头删
void LTPopFront(ListNode* phead);

//查找某数据第一次出现的位置
ListNode* LTFind(ListNode* phead, LDataType x);

//在pos位置之后插入数据
void LTInsert(ListNode* pos, LDataType x);

实现文件

List.c

#define _CRT_SECURE_NO_WARNINGS 1

#include<string.h>
#include"List.h"

//打印
void ListPrint(ListNode* phead)
{
	ListNode* pcur = phead->next;
	while (pcur != phead)
	{
		printf("%d->", pcur->val);
		pcur = pcur->next;
	}
	printf("\n");
}

//初始化
ListNode* LTInit()
{
	ListNode* phead = (ListNode*)malloc(sizeof(ListNode));
	if (phead == NULL) {
		perror("malloc fail!\n");
		exit(1);
	}
	phead->prev = phead;
	phead->next = phead;
	return phead;
}

//创建新节点
ListNode* BuyNode(LDataType x)
{
	ListNode* newnode = (ListNode*)malloc(sizeof(ListNode));
	if (newnode == NULL) {
		perror("malloc fail!\n");
		exit(1);
	}
	newnode->val = x;
	newnode->next = newnode;
	newnode->next = newnode;
	return newnode;
}

//销毁
void LTDestroy(ListNode* phead)
{
	ListNode* pcur = phead->next;
	while (pcur != phead)
	{
		ListNode* next = phead->next;
		free(phead);
		phead = next;
	}
	free(phead);
}

//判断链表是否为空
bool LTEmpty(ListNode* phead)
{
	bool judge = (phead->next == phead);
	return judge;
}

//尾插
void LTPushBack(ListNode* phead, LDataType x)
{
	assert(phead);
	ListNode* newnode = BuyNode(x); 
	ListNode* pcur = phead->prev;
	newnode->next = phead;
	newnode->prev = pcur;
	phead->prev = newnode;
	pcur->next = newnode;
}

//头插
void LTPushFront(ListNode* phead, LDataType x)
{
	assert(phead);
	ListNode* newnode = BuyNode(x);
	ListNode* pcur = phead->next;
	newnode->prev = phead;
	newnode->next = pcur;
	phead->next = newnode;
	pcur->prev = newnode;
}

//尾删
void LTPopBack(ListNode* phead)
{
	assert(phead);
	assert(phead->next != phead);
	ListNode* prev = phead->prev;
	prev->prev->next = phead;
	phead->prev = prev->prev;
	free(prev);
	prev = NULL;
}

//头删
void LTPopFront(ListNode* phead)
{
	assert(phead);
	assert(phead->next != phead);
	ListNode* next = phead->next;
	phead->next = next->next;
	next->next->prev = phead;
	free(next);
	next = NULL;
}

//查找某数据第一次出现的位置
ListNode* LTFind(ListNode* phead, LDataType x)
{
	assert(phead->next != phead);
	ListNode* pcur = phead->next;
	while (pcur != phead)
	{
		if (pcur->val == x)
			return pcur;
		pcur = pcur->next;
	}
	return NULL;
}

//在pos位置之后插入数据
void LTInsert(ListNode* pos, LDataType x)
{
	assert(pos);
	ListNode* newnode = BuyNode(x);
	ListNode* pcur = pos->next;
	newnode->prev = pos;
	newnode->next = pcur;
	pos->next = newnode;
	pcur->prev = newnode;
}

//删除pos
void LTErase(ListNode* pos)
{
	pos->prev->next = pos->next;
	pos->next->prev = pos->prev;
	free(pos);
	pos = NULL;
}

测试文件

test.c

#define _CRT_SECURE_NO_WARNINGS 1

#include"List.h"


void Test1()
{
	//初始化
	ListNode* phead = LTInit();


	//判断是否为空
	bool judge = LTEmpty(phead);
	if (judge)
		printf("是空链表。\n");
	else
		printf("是非空链表。\n");

	//测试尾插
	//LTPushBack(phead, 1);
	//LTPushBack(phead, 2);
	//LTPushBack(phead, 3);
	//LTPushBack(phead, 4);

	//测试头插
	LTPushFront(phead, 5);
	LTPushFront(phead, 6);
	LTPushFront(phead, 7);
	LTPushFront(phead, 8);

	//测试尾删
	//LTPopBack(phead);
	//LTPopBack(phead);
	//LTPopBack(phead);
	//LTPopBack(phead);

	//测试头删
	//LTPopFront(phead);
	//LTPopFront(phead);
	//LTPopFront(phead);
	//LTPopFront(phead);

	//测试查找
	ListNode* find = LTFind(phead, 6);
	//if (find == NULL)
	//	printf("不存在此数据！\n");
	//else {
	//	printf("%d\n", find->val);
	//}

	//测试插入数据
	LTInsert(find, 0);

	//测试删除pos
	LTErase(find);


	//打印
	ListPrint(phead);

	//判断是否为空
	judge = LTEmpty(phead);
	if (judge)
		printf("是空链表。\n");
	else
		printf("是非空链表。\n");


	//销毁
	LTDestroy(phead);
	phead = NULL;
}

int main()
{
	Test1();
	return 0;
}