LinkList.h

#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 int(*COMPARENODE)(LinkNode*, LinkNode*); //遍歷函數指針 typedef void(*PRINTNODE)(LinkNode*);#define COMPARENODE_TRUE 1 #define COMPARENODE_FALSE 0//初始化鏈表 LinkList* Init_LinkList();//插入 void InsertByPos_LinkList(LinkList *list, int pos,LinkNode *data);//刪除 void RemoveByPos_LinkList(LinkList *list, int pos);//查找 int FindByValue_LinkList(LinkList *list, LinkNode *data,COMPARENODE compare);//返回鏈表大小 int GetSize_LinkList(LinkList *list);//打印 void Print_LinkList(LinkList *list,PRINTNODE print);//釋放鏈表內存 void FreeSpace_LinkList(LinkList *list);#endif

LinkList.c

#include"LinkList.h" //初始化鏈表 LinkList* Init_LinkList() {LinkList* list = (LinkList*)malloc(sizeof(LinkList));list->head.next = NULL;list->size = 0;return list; }//插入 void InsertByPos_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 RemoveByPos_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;}//刪除結點pCurrent->next = pCurrent->next->next;list->size--;}//查找 int FindByValue_LinkList(LinkList *list, LinkNode *data, COMPARENODE compare) {if (list == NULL){return -1;}if (data == NULL){return -1;}//輔助指針變量LinkNode* pCurrent = list->head.next;int index=0;int flag = -1;while (pCurrent != NULL){if (compare(pCurrent, data) == 0){flag = index;break;}pCurrent= pCurrent->next;index++;}return flag; }//返回鏈表大小 int GetSize_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); }

LinkLIstme.c

#include"LinkList.h" #include<stdlib.h> #include<stdio.h> #include<string.h> LinkList* Init_LinkList() {LinkList *list = (LinkList *)malloc(sizeof(LinkList));list->size = 0;list->head.next = NULL; }void InsertByPos_LinkList(LinkList *list, int pos, LinkNode *data) {if (list == 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 RemoveByPos_LinkList(LinkList *list, int pos) {if (list == 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;}pCurrent->next = pCurrent->next->next;list->size--; }int FindByValue_LinkList(LinkList *list, LinkNode *data, COMPARENODE compare) {if (list == NULL){return;}int flag;int i = 0;//輔助指針變量LinkNode* pCurrent = &(list->head);//查找刪除結點的前一個結點for (i = 0; i < list->size; i++){while (compare(pCurrent, data) == 0){flag = COMPARENODE_TRUE;break;}pCurrent = pCurrent->next;}return i; }int GetSize_LinkList(LinkList *list) {return list->size; }//不會 void Print_LinkList(LinkList *list, PRINTNODE print) {}void FreeSpace_LinkList(LinkList *list) {free(list); }

企業鏈表.c

#include"LinkList.h" #include<string.h> #include<stdio.h> #include<stdlib.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* p1 = (Person*)node1;Person* p2 = (Person*)node2;if (strcmp(p1->name, p2->name) == 0 && p1->age == p2->age){return 0;}return -1; } int main() {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;LinkList *list = Init_LinkList();InsertByPos_LinkList(list, 0, (LinkNode *)&p1);InsertByPos_LinkList(list, 0, (LinkNode *)&p2);InsertByPos_LinkList(list, 0, (LinkNode *)&p3);InsertByPos_LinkList(list, 0, (LinkNode *)&p4);InsertByPos_LinkList(list, 0, (LinkNode *)&p5);//打印Print_LinkList(list, MyPrint);Person findP;strcpy(findP.name, "bbb");findP.age = 20;int pos = FindByValue_LinkList(list, (LinkNode*)&findP, MyCompare);printf("位置：%d\n", pos);//釋放鏈表內存FreeSpace_LinkList(list);system("pause");return 0; } /運行結果/ /* Name:eee age:50 Name:ddd age:40 Name:ccc age:30 Name:bbb age:20 Name:aaa age:10 位置：3 請按任意鍵繼續. . . */

運行結果：

?

總結

以上是生活随笔為你收集整理的数据结构-链表4-企业链表的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。