C语言对另一种企业单向链表的初始化、插入、删除、销毁等操作

链表模型

只将前四个字节用来作为指针域，并且只对指针域进行操作即可，并不会对数据进行操作。

链表代码实现

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

//节点的结构体
struct LinkNode {
	struct LinkNode* next;
};

//链表的结构体
struct LinkList {
	int m_size;
	struct LinkNode pHeader;
};

typedef void* LList;

//链表的初始化
LList init_LinkList() {

	struct LinkList* myList = malloc(sizeof(struct LinkList));
	if (myList == NULL)
		return NULL;
	myList->m_size = 0;
	myList->pHeader.next = NULL;

	return myList;
}


//链表的插入
void insert_LinkList(LList list, int pos, void* data) {
	if (list == NULL || data == NULL)
		return;
	struct LinkList* myList = list;
	//如果插入位置不适合就直接进行尾插
	if (pos < 0 || pos > myList->m_size-1)
	{
		pos = myList->m_size;
	}
	//只操作数据的前四个字节，因为企业中前四个字节保存的是指针域
	struct LinkNode* myNode = data;

	//进行插入前先找到前驱结点 
	struct LinkNode* pCurrent = &myList->pHeader;
	for (int i = 0; i < pos; i++) {
		pCurrent = pCurrent->next;
	}//此处将指针pCurrent移动到 要插入位置的上一个节点

	//更新节点的连接关系
	myNode->next = pCurrent->next;
	pCurrent->next = myNode;

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

//遍历链表
void for_each_LinkList(LList list, void(*myPrint)(void* data)) {
	if (list == NULL)
		return;
	struct LinkList* myList = list;
	struct LinkNode* pCurrent = myList->pHeader.next;
	for (int i = 0; i < myList->m_size; i++) {

		myPrint(pCurrent);
		pCurrent = pCurrent->next;
	}
}

//删除节点，按位置进行删除
void delete_by_pos(LList list, int pos) {
	if (list == NULL)
		return;
	struct LinkList* myList = list;
	if (pos < 0 || pos >= myList->m_size)
		return;
	struct LinkNode* myNode = &myList->pHeader;
	for (int i = 0; i < pos; i++)
	{
		myNode = myNode->next;//此时的myNode指向的是要删除位置的前驱节点
	}
	//找到要删除的节点
	struct LinkNode* delNode = myNode->next;
	//更新节点的连接关系，将要删除节点的后继节点地址赋给前驱节点的指针域
	myNode->next = delNode->next;

	删除当前位置节点
	//free(delNode);//这里并没有用malloc去开辟空间，不应该去用free释放
	//delNode = NULL;

	//更新链表中节点个数
	myList->m_size--;
}

//对链表进行销毁
void destroy_LinkList(LList list) {
	if (list == NULL)
		return;
	struct LinkList* myList = list;
	myList->m_size = 0;
	myList->pHeader.next = NULL;
	free(list);
	list = NULL;
}



//测试
typedef struct Person {
	void* node;
	char name[64];
	int age;
}Person;
void myPrint(void* data) {
	Person* p = data;
	printf("姓名：%s, 年龄：%d\n", p->name, p->age);
}
void test01() {
	Person p1 = { NULL, "bobo",23 };
	Person p2 = { NULL, "hoho",24 };
	Person p3 = { NULL, "toto",25 };
	Person p4 = { NULL, "yoyo",26 };
	//初始化得到链表
	struct LinkList* myList = init_LinkList();

	//插入链表
	insert_LinkList(myList, 0, &p1);
	insert_LinkList(myList, 1, &p2);
	insert_LinkList(myList, 0, &p3);
	insert_LinkList(myList, 2, &p4);

	//对链表进行遍历
	for_each_LinkList(myList, myPrint);

	//按照位置进行删除
	delete_by_pos(myList, 3);
	printf("++++++++++++++++++++++++++\n");
	//对链表进行遍历
	for_each_LinkList(myList, myPrint);

	//对链表进行清空销毁
	destroy_LinkList(myList);
	myList = NULL;
}

int main()
{
	test01();
	system("pause");
	return EXIT_SUCCESS;
}