线性表之带头双向循环链表（动态~增删差改找插）

头文件List.h

#include<stdio.h>
#include <malloc.h>
#include <assert.h>
#include<windows.h>

//带头+双向+循环链表增删查改实现
typedef int LTDataType;
typedef struct ListNode
{
    
    
	LTDataType _data;
	struct ListNode* next;
	struct ListNode* prev;
}ListNode;
// 创建返回链表的头结点.
ListNode* ListCreate();
// 双向链表销毁
void ListDestory(ListNode** pplist);
// 双向链表打印
void ListPrint(ListNode* plist);
// 双向链表尾插
void ListPushBack(ListNode* plist, LTDataType x);
// 双向链表尾删
void ListPopBack(ListNode* plist);
// 双向链表头插
void ListPushFront(ListNode* plist, LTDataType x);
// 双向链表头删
void ListPopFront(ListNode* plist);
// 双向链表删除pos位置的节点
void ListErase(ListNode* pos);
// 双向链表查找
ListNode* ListFind(ListNode* plist, LTDataType x);
// 双向链表在pos的前面进行插入
void ListInsert(ListNode* pos, LTDataType x);

源文件List.c

# include"List.h"

//新增结点
ListNode* buyListDestory(LTDataType data){
    
    
	ListNode* newnode = (ListNode*)malloc(sizeof(ListNode));
	
	newnode->_data = data;
	newnode->next = NULL;
	newnode->prev = NULL;
	return newnode;
}

// 创建返回链表的头结点.
ListNode* ListCreate(){
    
    
	ListNode* plist = buyListDestory(0);
	plist->next = plist;
	plist->prev = plist;
	return plist;
}
// 双向链表销毁
void ListDestory(ListNode** pplist){
    
    
	assert(pplist);
	ListNode* cur = (*pplist)->next;
	while (cur !=*pplist){
    
    
		(*pplist)->next = cur->next;
		free(cur);
		cur = (*pplist)->next;
	}
	free(*pplist);
	*pplist = NULL;
}
// 双向链表打印
void ListPrint(ListNode* plist){
    
    
	assert(plist);
	ListNode* cur = plist->next;
	while (cur != plist){
    
    
		printf("%d ", cur->_data);
		cur = cur->next;
	}
	printf("\n");
}
// 双向链表尾插
void ListPushBack(ListNode* plist, LTDataType x){
    
    
	assert(plist);
	ListNode* newnode = buyListDestory(x);
	newnode->next = plist;
	newnode->prev = plist->prev;
	plist->prev->next = newnode;
	
	plist->prev = newnode;
}
// 双向链表尾删
void ListPopBack(ListNode* plist){
    
    
	assert(plist);
	ListNode* cur = plist->prev;
	    cur->prev->next = plist;
		plist->prev = cur->prev;
		free(cur);
}
// 双向链表头插
void ListPushFront(ListNode* plist, LTDataType x){
    
    
	assert(plist);
	ListNode* newnode = buyListDestory(x);
	newnode->next = plist->next;
	newnode->prev = plist;
	plist->next = newnode;
	newnode->next->prev = newnode;
}
// 双向链表头删
void ListPopFront(ListNode* plist){
    
    
	assert(plist);
	ListNode* cur = plist->next;
	plist->next = cur->next;
	cur->next->prev = plist;
	free(cur);
}
// 双向链表查找
ListNode* ListFind(ListNode* plist, LTDataType x){
    
    
	assert(plist);
	ListNode* cur = plist->next;
	while (cur != plist){
    
    
		if (cur->_data == x){
    
    
			return cur;
		}
		cur = cur->next;
	}
	return NULL;
}
// 双向链表删除pos位置的节点
void ListErase(ListNode* pos){
    
    
	if (pos == NULL){
    
    
		return;
	}
	pos->prev->next = pos->next;
	pos->next->prev = pos->prev;
	free(pos);
}
// 双向链表在pos的前面进行插入
void ListInsert(ListNode* pos, LTDataType x){
    
    
	if (pos == NULL){
    
    
		return;
	}
	ListNode* newnode = buyListDestory(x);
	newnode->next = pos;
	newnode->prev = pos->prev;
	pos->prev->next= newnode;
	pos->prev = newnode;
	
}

源文件test.c

# include"List.h"



int Test(){
    
    
	ListNode* plist=ListCreate();
	ListPushBack(plist,1);
	ListPushBack(plist, 2);
	ListPushBack(plist, 3);
	ListPushBack(plist, 4);
	ListPushBack(plist, 5);
	ListPrint(plist);
	ListPopBack(plist);
	ListPopBack(plist);
	ListPrint(plist);
	//ListPopBack(plist);
	ListPushFront(plist, 0);
	ListPrint(plist);
	ListPopFront(plist);
	ListErase(ListFind(plist, 3));
	ListInsert(ListFind(plist, 2),5);


	ListPrint(plist);
	ListDestory(&plist);
}
int main(){
    
    

	Test();

	system("pause");
	return 0;
}