3.单向链表-企业版-526互联

#define _CRT_SECURE_NO_WARNINGS
//2023年6月1日14:56:43
#include<stdio.h>
#include<string.h>
#include<stdlib.h>

//节点结构体
struct LinkNode
{
	//只维护指针域 数据域由用户自己开辟
	struct Linknode* next;
};

//链表结构体
struct LList
{
	struct LinkNode pHeader;
	int m_Size;
};

typedef void* LinkList;

//初始化链表
LinkList init_LinkList()
{
	struct LList* myList = malloc(sizeof(struct LList));

	if (myList == NULL)
	{
		return NULL;
	}

	myList->pHeader.next = NULL;
	myList->m_Size = 0;

	return myList;
}

//插入
void insert_LinkList(LinkList list, int pos, void* data)
{
	if (list == NULL)
	{
		return;
	}
	if (data == NULL)
	{
		return;
	}

	struct LList* myList = list;
	if (pos < 0 || pos > myList->m_Size - 1)
	{
		//无效位置进行尾插
		pos = myList->m_Size;
	}

	//用户数据的前4个字节  由我们来使用
	struct LinkNode* myNode = data;

	//赵插入节点的前驱节点
	struct LinkNode* pCurrent = &myList->pHeader;

	for (int i = 0; i < pos; i++)
	{
		pCurrent = pCurrent->next;
	}
	//pCurent是前驱节点位置
	myNode->next = pCurrent->next;
	pCurrent->next = myNode;

	//更新链表长度
	myList->m_Size++;
}

//遍历链表
void foreach_LinkList(LinkList list, void(*myForeach)(void *))
{
	if (list == NULL)
	{
		return NULL;
	}
	
	struct LList* myList = list;

	struct LinkNode* myNode = myList->pHeader.next;

	for (int i = 0; i < myList->m_Size; i++)
	{
		myForeach(myNode);
		myNode = myNode->next;
	}
}

//测试
struct Person
{
	void * node;
	char name[64];
	int age;
};

void myPrintPerson(void* data)
{
	struct Person* p = data;
	printf("姓名：%s，年龄：%d\n", p->name, p->age);
}
void test01()
{
	//初始化链表
	LinkList mylist = init_LinkList();

	//创建数据
	struct Person p1 = {NULL, "aaa", 10};
	struct Person p2 = {NULL, "bbb", 20};
	struct Person p3 = {NULL, "ccc", 30};
	struct Person p4 = {NULL, "ddd", 40};
	struct Person p5 = {NULL, "eee", 50};

	insert_LinkList(mylist, 0, &p1);
	insert_LinkList(mylist, 0, &p2);
	insert_LinkList(mylist, 1, &p3);
	insert_LinkList(mylist, -1, &p4);
	insert_LinkList(mylist, 0, &p5);

	//遍历链表
	foreach_LinkList(mylist, myPrintPerson);
}

int main()
{
	test01();
	return 0;
}
参考资料来源：
黑马程序员
单向