企业级业务链表

#ifndef LINKLIST_H
# define LINKLIST_H
# include <stdio.h>
# include <stdlib.h>


//链表 小结点
typedef struct LINKNODE
{
struct LINKNODE* next;
}LinkNode;


//链表结点
typedef struct LINKLIST
{
LinkNode head;
int size;
}LinkList;


//遍历函数指针
typedef void(*PRINTNODE)(LinkNode*);


//比较的函数指针
typedef int(*COMPARE)(LinkNode* , LinkNode*);


//初始化链表
LinkList* Init_LinkList();
//插入
void Insert_LinkList(LinkList* list, int pos, LinkNode* data);
//删除
void Remove_LinkList(LinkList* list, int pos);
//查找
int Find_LinkList(LinkList* list, LinkNode* data, COMPARE compare);
//返回链表大小
int Size_LinkList(LinkList* list);
//打印
void Print_LinkList(LinkList* list, PRINTNODE print);
//释放链表内存
void FreeSpace_LinkList(LinkList* list);

#endif

# include "LinkList.h"


//初始化链表
LinkList* Init_LinkList()
{
LinkList* list = (LinkList* )malloc(sizeof(LinkList));
list->size = 0;
list->head.next = NULL;
return list;
}
//插入
void Insert_LinkList(LinkList* list, int pos, LinkNode* data)
{
if(list == NULL)
{
return ;
}
if(data == NULL)
{
return ;
}
if(pos < 0 || pos > list->size)
{
pos = list->size;
}


//查找插入位置
LinkNode* pCurrent = &(list->head);
for(int i = 0; i < pos; i++)
{
pCurrent = pCurrent->next;
}



//插入新结点
data->next = pCurrent->next;
pCurrent->next = data;


list->size++;
}
//删除
void Remove_LinkList(LinkList* list, int pos)
{
if(list == NULL)
{
return ;
}


if(pos < 0 || pos >= list->size)
{
return ;
}


//辅助指针变量
LinkNode* pCurrent = &(list->head);
for(int i = 0; i < pos; i++)
{
pCurrent = pCurrent->next;
}
//删除结点
// LinkNode* temp = pCurrent;
//因为没有malloc内存所以直接赋值就行
pCurrent->next = pCurrent->next->next;


list->size--;
}
//查找
int Find_LinkList(LinkList* list, LinkNode* data, COMPARE compare)
{
if(list == NULL)
{
return -1;
}
if(data == NULL)
{
return -1;
}
printf("查找\n");
//辅助指针变量
LinkNode* pCurrent = list->head.next;
// Print_LinkList(LinkList* list, PRINTNODE print);
int index = 0;
int flag = -1;
while(pCurrent != NULL)
{

//printf("index = %d\n", index);
if(compare(pCurrent, data) == 0)
{
flag = index;
printf("flag = %d\n",flag);
break;
}
index++;
pCurrent = pCurrent->next;
}


return flag;
}
//返回链表大小
int Size_LinkList(LinkList* list)
{
return list->size;
}
//打印
void Print_LinkList(LinkList* list, PRINTNODE print)
{
if(list == NULL)
{
return ;
}
//辅助指针
LinkNode* pCurrent = list->head.next;
while(pCurrent != NULL)
{
print(pCurrent);
pCurrent = pCurrent->next;
}
}
//释放链表内存
void FreeSpace_LinkList(LinkList* list)
{
if(list == NULL)
{
return ;
}
free(list);

}

# include <string.h>
# include "LinkList.h"


typedef struct PERSON
{
LinkNode node;
char name[64];
int age;
}Person;


void MyPrint(LinkNode* data)
{
Person* p = (Person*)data;
printf("Name: %s Age: %d\n",p->name, p->age);
}


int Mycompare(LinkNode* node1, LinkNode* node2)
{
//强转恢复成Person
Person* p1 = (Person*)node1;
Person* p2 = (Person*)node2;
if(strcmp(p1->name, p2->name) == 0 && p1->age == p2->age)
{
return 0;
}
return -1;
}


void test01()
{
//创建链表
LinkList* list = Init_LinkList();


//创建数据
Person p1, p2, p3, p4, p5;
strcpy(p1.name, "aaa");
strcpy(p2.name, "bbb");
strcpy(p3.name, "ccc");
strcpy(p4.name, "ddd");
strcpy(p5.name, "eee");


p1.age = 10;
p2.age = 20;
p3.age = 30;
p4.age = 40;
p5.age = 50;


//将结点插入链表
Insert_LinkList(list, 0,  (LinkNode*)&p1);
Insert_LinkList(list, 0,  (LinkNode*)&p2);
Insert_LinkList(list, 0,  (LinkNode*)&p3);
Insert_LinkList(list, 0,  (LinkNode*)&p4);
Insert_LinkList(list, 0,  (LinkNode*)&p5);


//打印
Print_LinkList(list, MyPrint);
//删除结点
Remove_LinkList(list, 2);
printf("----------\n");
//打印
Print_LinkList(list, MyPrint);
//查找
Person findp;
strcpy(findp.name, "aaa");


findp.age = 10;
// printf("%s %d\n",findp.name, findp.age);
int pos = Find_LinkList(list, (LinkNode*)&findp,Mycompare);
printf("位置:%d\n",pos);
//释放链表内存
FreeSpace_LinkList(list);


}


int main(int argc, char *argv[])
{
test01();


return 0;
}