带头双向循环链表的详细操作（C语言）

最新推荐文章于 2023-02-15 18:24:57 发布

qq_19926581

最新推荐文章于 2023-02-15 18:24:57 发布

阅读量474

点赞数

文章标签：链表数据结构

本文链接：https://blog.csdn.net/qq_19926581/article/details/126322055

版权

带头双向循环链表的结构为：

1、初始化

#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
typedef int DLDataType;
typedef struct DLNode
{
	DLDataType data;
	struct DLNode* prev;
	struct DLNode* next;
}DLNode;
DLNode* DLInit()
{
	DLNode* phead = (DLNode*)malloc(sizeof(DLNode));//创建头结点
	if (phead == NULL)//检查头结点是否创建成功
	{
		perror("DLInit fail");
		exit(-1);
	}
	phead->prev = phead;//头结点的前指针指向自己
	phead->next = phead;//头结点的后指针指向自己
}

2.、尾插

tail指针在phead的前面，分别建立tail与newnode、newnode和phead之间的连接

DLNode* Buynode(DLDataType x)
{
	DLNode* newnode = (DLNode*)malloc(sizeof(DLNode));
	if (newnode == NULL)
	{
		perror("Buynode fail");
		exit(-1);
	}
	newnode->data = x;
	newnode->prev = NULL;
	newnode->next = NULL;
	return newnode;
}
void DLPushBack(DLNode* phead, DLDataType x)
{
	assert(phead);
	DLNode* newnode = Buynode(x);
	DLNode* tail = phead->prev;
	tail->next = newnode;
	newnode->prev = tail;
	newnode->next = phead;
	phead->prev = newnode;
}

2.、头插

next指针在phead的后面，分别建立phead和newnode、newnode与next之间的连接

void DLPushFront(DLNode* phead, DLDataType x)
{
	assert(phead);
	DLNode* newnode = Buynode(x);
	DLNode* next = phead->next;
	phead->next = newnode;
	newnode->prev = phead;
	newnode->next = next;
	next->prev = newnode;
}

3、判断链表是否为空

如果链表的下一个指针指向自己，则为空

bool DLEmpty(DLNode* phead)//判断链表是否为空，如果链表的下一个指针指向自己，则为空
{
	assert(phead);
	return phead->next == phead;
}

4、尾删

切断tial与 phead之间的联系，然后prev和phead建立连接

void DLPopFront(DLNode* phead)
{
	assert(phead);
	assert(!DLEmpty(phead));
	DLNode* del = phead->next;
	DLNode* next = del->next;
	phead->next = next;
	next->prev = phead;
	free(del);
	del = NULL;
}

5、头删

切断 phead与del之间的联系，然后next和phead建立连接.注意：当phead后只有一个元素可以删除时，del->next==phead，代码也是适用的。

void DLPopBack(DLNode* phead)
{
	assert(phead);
	assert(!DLEmpty(phead));
	DLNode* tail = phead->prev;
	DLNode* prev = tail->prev;
	prev->next = phead;
	phead->prev = prev;
	free(tail);
	tail = NULL;
}

6、链表的长度

size_t DLSize(DLNode* phead)
{
	assert(phead);
	DLNode* cur = phead->next;
	size_t n = 0;
	while (cur != phead)
	{
		++n;
		cur = cur->next;
	}
	return n;
}

7、在链表中查找元素X的位置

找到X则返回X的位置，找不到则返回NULL。查找功能有助于实现任意位置的插入和删除功能

DLNode* DLFind(DLNode* phead, DLDataType x)
{
	assert(phead);
	DLNode* cur = phead->next;
	while (cur != phead)//遍历循环链表的条件是cur!=phead
	{
		if (cur->data == x)//找到x则返回cur的位置
			return cur;
		cur = cur->next;
	}
	return NULL;//找不到则返回NULL
}

8、链表任意位置的插入

在pos前插入x,先找到prev，然后建立prev和newnode、newnode和pos的联系

void DLInsert(DLNode* pos, DLDataType x)
{
	assert(pos);
	DLNode* newnode = Buynode(x);
	DLNode* prev = pos->prev;
	prev->next = newnode;
	newnode->prev = prev;
	newnode->next = pos;
	pos->prev = newnode;
}

9、链表任意位置的删除

找到pos前后指针prev和next，直接建立prev和next之间的连接

void DLErase(DLNode* pos)
{
	assert(pos);
	DLNode* prev = pos->prev;
	DLNode* next = pos->next;
	prev->next = next;
	next->prev = prev;
	free(pos);
	pos = NULL;
}

10、链表的销毁

void DLDestroy(DLNode* phead)
{
	assert(phead);
	DLNode* cur = phead->next;
	while (cur != phead)
	{
		DLNode* next = cur->next;
		free(cur);
		cur = next;
	}
	free(phead);
	phead = NULL;
}

11、完整代码

#pragma once
#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#include<stdbool.h>
typedef int DLDataType;
typedef struct DLNode
{
	DLDataType data;
	struct DLNode* prev;
	struct DLNode* next;
}DLNode;
DLNode* DLInit()
{
	DLNode* phead = (DLNode*)malloc(sizeof(DLNode));//创建头结点
	if (phead == NULL)//检查头结点是否创建成功
	{
		perror("DLInit fail");
		exit(-1);
	}
	phead->prev = phead;//头结点的前指针指向自己
	phead->next = phead;//头结点的后指针指向自己
}
void DLPrint(DLNode* phead)
{
	assert(phead);
	DLNode* cur = phead->next;
	while (cur != phead)
	{
		printf("%d ", cur->data);
		cur = cur->next;
	}
}
DLNode* Buynode(DLDataType x)
{
	DLNode* newnode = (DLNode*)malloc(sizeof(DLNode));
	if (newnode == NULL)
	{
		perror("Buynode fail");
		exit(-1);
	}
	newnode->data = x;
	newnode->prev = NULL;
	newnode->next = NULL;
	return newnode;
}
void DLPushBack(DLNode* phead, DLDataType x)
{
	assert(phead);
	DLNode* newnode = Buynode(x);
	DLNode* tail = phead->prev;
	tail->next = newnode;
	newnode->prev = tail;
	newnode->next = phead;
	phead->prev = newnode;
}
void DLPushFront(DLNode* phead, DLDataType x)
{
	assert(phead);
	DLNode* newnode = Buynode(x);
	DLNode* next = phead->next;
	phead->next = newnode;
	newnode->prev = phead;
	newnode->next = next;
	next->prev = newnode;
}
void DLPopBack(DLNode* phead)
{
	assert(phead);
	assert(!DLEmpty(phead));
	DLNode* tail = phead->prev;
	DLNode* prev = tail->prev;
	prev->next = phead;
	phead->prev = prev;
	free(tail);
	tail = NULL;
}
void DLPopFront(DLNode* phead)
{
	assert(phead);
	assert(!DLEmpty(phead));
	DLNode* del = phead->next;
	DLNode* next = del->next;
	phead->next = next;
	next->prev = phead;
	free(del);
	del = NULL;
}
bool DLEmpty(DLNode* phead)//判断链表是否为空，如果链表的下一个指针指向自己，则为空
{
	assert(phead);
	return phead->next == phead;
}
size_t DLSize(DLNode* phead)
{
	assert(phead);
	DLNode* cur = phead->next;
	size_t n = 0;
	while (cur != phead)
	{
		++n;
		cur = cur->next;
	}
	return n;
}
DLNode* DLFind(DLNode* phead, DLDataType x)
{
	assert(phead);
	DLNode* cur = phead->next;
	while (cur != phead)//遍历循环链表的条件是cur!=phead
	{
		if (cur->data == x)//找到x则返回cur的位置
			return cur;
		cur = cur->next;
	}
	return NULL;//找不到则返回NULL
}
void DLInsert(DLNode* pos, DLDataType x)
{
	assert(pos);
	DLNode* newnode = Buynode(x);
	DLNode* prev = pos->prev;
	prev->next = newnode;
	newnode->prev = prev;
	newnode->next = pos;
	pos->prev = newnode;
}
void DLErase(DLNode* pos)
{
	assert(pos);
	DLNode* prev = pos->prev;
	DLNode* next = pos->next;
	prev->next = next;
	next->prev = prev;
	free(pos);
	pos = NULL;
}
void DLDestroy(DLNode* phead)
{
	assert(phead);
	DLNode* cur = phead->next;
	while (cur != phead)
	{
		DLNode* next = cur->next;
		free(cur);
		cur = next;
	}
	free(phead);
	phead = NULL;
}
test1()
{
	DLNode* plist = DLInit();
	DLPushBack(plist, 1);
	DLPushBack(plist, 2);
	DLPushBack(plist, 3);
	DLPushBack(plist, 4);
	DLPushFront(plist, 10);
	DLPushFront(plist, 20);
	DLPushFront(plist, 30);
	DLDestroy(plist);
	DLPrint(plist);
}
int main()
{
	test1();
	return 0;
}