带你理解单链表（如果对你有帮助的话请点赞呗）

---

🧨前言

本人目前是西安邮电大学计算机科学与技术专业一位普通的大学生,Q：1243032591
🧧我的码云主页点击这里🧧

这篇文章是我关于单链表写的文章，如果大家对于单链表的概念还不是很熟的话请点击这里
👉个人对于单链表的简单理解
按照我之前写代码的惯例，这次依旧分为三个文件 Sqlist.c Sqlist.h test.c

---

🚂Sqlist.h(函数声明，并且引用头文件和创建结构体)

#pragma once
#include<stdio.h>
#include<stdlib.h>

typedef int datatype;
struct SqlistNode
{
	datatype data;
	struct SqlistNode* next;
};
typedef struct SqlistNode Sqt;

void SqlistPrint(Sqt* cur);
void SqlistPushback(Sqt** pphead, datatype x);
void SqlistPushFront(Sqt** pphead, datatype x);
void SqlistPopFront(Sqt** pphead);
void SqlistPopBack(Sqt** pphead);
Sqt* SqlistFind(Sqt*phead, datatype x);
void SqtlistInsert(Sqt** pphead,Sqt* pos, datatype x);
void SqtlistErase(Sqt** pphead, Sqt* pos);

---

⏩Sqlist.c（实现函数功能，用的时候记得包含Sqlist.h）

#define _CRT_SECURE_NO_WARNINGS 1
#include"Sqlist.h"
Sqt* BuyNode(datatype x)
{
	Sqt* NewNode = (Sqt*)malloc(sizeof(Sqt));
	if (NewNode != NULL)
	{
		NewNode->data = x;
		NewNode->next = NULL;
	}
	return NewNode;
}
void SqlistPushback(Sqt** pphead,datatype x)
{
	Sqt* NewNode = BuyNode(x);
	Sqt* tail = NULL;
	if (*pphead == NULL)
	{
		*pphead = NewNode;
	}
	else
	{
		tail = *pphead;
		while (tail->next!=NULL)
		{
			tail = tail->next;
		}
		tail->next = NewNode;
	}
}
void  SqlistPushFront(Sqt** pphead, datatype x)
{
	Sqt* NewNode = BuyNode(x);
	NewNode->next = *pphead;
	*pphead = NewNode;
}
void SqlistPrint(Sqt* cur)
{
	while (cur!=NULL)
	{
		printf("%d -> ", cur->data);
		cur = cur->next;
	}
	printf("NULL\n");
}
void SqlistPopFront(Sqt** pphead)
{
	Sqt* Next = (*pphead)->next;
	free(*pphead);
	*pphead = Next;
}
void SqlistPopBack(Sqt** pphead)
{
	if (*pphead == NULL)
	{
		return;
	}
	else if((*pphead)->next==NULL)
	{
		free(*pphead);
		*pphead = NULL;
	}
	else
	{
		Sqt* pre = NULL;
		Sqt* tail = *pphead;
		while (tail->next!=NULL)
		{
			pre = tail;
			tail = tail->next;
		}
		free(tail);
		pre->next = NULL;
	}
}
Sqt* SqlistFind(Sqt* phead, datatype x)
{
	Sqt* cur = phead;
	while (cur)
	{
		if (cur->data == x)
			return cur;
		cur = cur->next;
	}
	return NULL;
}
void SqtlistInsert(Sqt** pphead, Sqt* pos, datatype x)
{
	if (pos == *pphead)
	{
		SqlistPushFront(pphead,x);
	}
	else
	{
		Sqt* NewNode = BuyNode(x);
		Sqt* pre = *pphead;
		while (pre->next != pos)
		{
			pre = pre->next;
		}
		pre->next = NewNode;
		NewNode->next = pos;
	}
	
}
void SqtlistErase(Sqt** pphead, Sqt* pos)
{
	if(*pphead==pos)
		SqlistPopFront(pphead);
	else
	{
		Sqt* pre = *pphead;
		while (pre->next != pos)
		{
			pre = pre->next;
		}
		pre->next = pos->next;
		free(pos);
	}
	
}

---

🌹 test.c(输入数据并且测试,用的时候记得包含Sqlist.h)

#define _CRT_SECURE_NO_WARNINGS 1
#include"Sqlist.h"
void SqlistTest( )
{
	Sqt* plist = NULL;
	SqlistPushback(&plist,1);
	SqlistPushback(&plist,2);
	SqlistPushback(&plist,3);
	SqlistPushFront(&plist, 0);
	SqlistPrint(plist);
	Sqt* pos = NULL;
	/*if (pos)
	{
		SqtlistErase(&plist, pos);
	}
	SqlistPrint(plist);*/
	pos = SqlistFind(plist, 0);
	if (pos)
	{
		SqtlistInsert(&plist, pos, 5);
	}
	SqlistPrint(plist);
	/*SqlistPopFront(&plist);
	SqlistPrint(plist);
	SqlistPopFront(&plist);
	SqlistPrint(plist);
	SqlistPopBack(&plist);
	SqlistPrint(plist);
	SqlistPopBack(&plist);
	SqlistPrint(plist);
	SqlistPopBack(&plist);
	SqlistPrint(plist);*/
}

int main(void)
{
	SqlistTest();
	return 0;
}

---

🍕接下来是单链表中的函数具体实现

🦺插入数据

🚂申请空间 BuyNode

单链表每次插入数据都要申请一块空间，可以理解为火车要装货物得用车厢装货物然后将单节车厢连接到火车后面

Sqt* BuyNode(datatype x)
{
	Sqt* NewNode = (Sqt*)malloc(sizeof(Sqt));
	if (NewNode != NULL)
	{
		NewNode->data = x;
		NewNode->next = NULL;
	}
	return NewNode;
}

---

🚂头插 SqlistPushFront

void  SqlistPushFront(Sqt** pphead, datatype x)
{
	Sqt* NewNode = BuyNode(x);
	NewNode->next = *pphead;
	*pphead = NewNode;
}

---

🚂尾插 SqlistPushback

void SqlistPushback(Sqt** pphead,datatype x)
{
	Sqt* NewNode = BuyNode(x);
	Sqt* tail = NULL;
	if (*pphead == NULL)
	{
		*pphead = NewNode;
	}
	else
	{
		tail = *pphead;
		while (tail->next!=NULL)
		{
			tail = tail->next;
		}
		tail->next = NewNode;
	}
}

---

🚂在指定数据之前插入数据 SqtlistInsert

void SqtlistInsert(Sqt** pphead, Sqt* pos, datatype x)
{
	if (pos == *pphead)
	{
		SqlistPushFront(pphead,x);
	}
	else
	{
		Sqt* NewNode = BuyNode(x);
		Sqt* pre = *pphead;
		while (pre->next != pos)
		{
			pre = pre->next;
		}
		pre->next = NewNode;
		NewNode->next = pos;
	}
	
}

---

🚂删除数据

🚂头删 SqlistPopFront

void SqlistPopFront(Sqt** pphead)
{
	if (*pphead == NULL)
	{
		return;
	}
	Sqt* Next = (*pphead)->next;
	free(*pphead);
	*pphead = Next;
}

---

🚂尾删 SqlistPopBack

void SqlistPopBack(Sqt** pphead)
{
	if (*pphead == NULL)
	{
		return;
	}
	else if((*pphead)->next==NULL)
	{
		free(*pphead);
		*pphead = NULL;
	}
	else
	{
		Sqt* pre = NULL;
		Sqt* tail = *pphead;
		while (tail->next!=NULL)
		{
			pre = tail;
			tail = tail->next;
		}
		free(tail);
		pre->next = NULL;
	}
}

---

🚂删除指定数据 SqtlistErase

void SqtlistErase(Sqt** pphead, Sqt* pos)
{
	if(*pphead==pos)
		SqlistPopFront(pphead);
	else
	{
		Sqt* pre = *pphead;
		while (pre->next != pos)
		{
			pre = pre->next;
		}
		pre->next = pos->next;
		free(pos);
	}
	

---

🚂查找数据 SqlistFind

如果找到了的话返回该节点的指针（地址），如果找不到就返回NULL

Sqt* SqlistFind(Sqt* phead, datatype x)
{
	Sqt* cur = phead;
	while (cur)
	{
		if (cur->data == x)
			return cur;
		cur = cur->next;
	}
	return NULL;
}

---

🚂打印数据 SqlistPrint

void SqlistPrint(Sqt* cur)
{
	while (cur!=NULL)
	{
		printf("%d -> ", cur->data);
		cur = cur->next;
	}
	printf("NULL\n");
}

---

🎉结语

单链表这一期就完结撒花啦🍻，很感谢大家能看到这里，希望这篇文章对大家有帮助，如果大家有什么好的见解或者有什么疑问的话欢迎大家评论或者联系我。