// 企業鏈表.cpp : 此文件包含 "main" 函數。程序執行將在此處開始并結束。
// 鏈表改進版 企業常用#include <iostream>
#include<stdlib.h>//鏈表小節點 不包含數據域
typedef struct linknode {struct linknode* next;
}linknode;
//鏈表節點 ?數據指針分離的設計
typedef struct linklist {linknode head;int size;
}linklist;//typedef struct mydata {
// ? ?linknode node;//首地址
// ? ?char name[64];
// ? ?int age;
//}mydata;//企業鏈表數據結構聲明，必須在第一個位置聲明節點，開始串聯數據（防止產生偏移量）
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);
}//遍歷函數指針
typedef void(*PRINTNODE)(linknode*);//比較函數指針
typedef int(*COMPARENODE)(linknode*, linknode*);linklist* Inint_linklist() {linklist* list = (linklist*)malloc(sizeof(linklist));list->head.next = NULL;list->size = 0;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* pcur = &(list->head);for (int i = 0; i < pos; ++i) {pcur = pcur->next;}//插入新節點data->next = pcur->next;pcur->next = data;list->size++;
}void Remove_linklist(linklist* list, int pos) {if (list == NULL) {return;}if (pos<0 || pos>=list->size) {return;}//linknode* pcur = &(list->head);for (int i = 0; i < pos; ++i) {pcur = pcur->next;}//刪除節點pcur->next = pcur->next->next;list->size--;
}
//COMPARENODE compare 回調函數
int Find_linklist(linklist* list, linknode* data, COMPARENODE compare) {if (list == NULL) {return 0;}if (data==NULL) {return 0;}//輔助指針變量linknode* pcur = list->head.next;int index = 0;int flag = -1;while (pcur != NULL) {if (compare(pcur, data) == 0) {flag = index;break;}pcur = pcur->next;index++;}return flag;
}int Size_linklist(linklist* list) {return 0;
}void Print_linklist(linklist* list,PRINTNODE print) {if (list == NULL) {return;}linknode* pcur = list->head.next;while(pcur != NULL) {print(pcur);pcur = pcur->next;}
}void Free_linklist(linklist* list) {if (list == NULL) {return;}free(list);
}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()
{linklist* list = Inint_linklist();person p1, p2, p3, p4, p5;strcpy_s(p1.name, "aaaa");strcpy_s(p2.name, "bbbb");strcpy_s(p3.name, "cccc");strcpy_s(p4.name, "dddd");strcpy_s(p5.name, "eeee");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);printf("-----------------------\n");Remove_linklist(list,2);Print_linklist(list, Myprint);printf("-----------------------\n");//查找person findx;strcpy_s(findx.name, "bbbb");findx.age = 20;int pos= Find_linklist(list, (linknode*)&findx, mycompare);printf("position=%d\n",pos);printf("-----------------------\n");//釋放內存Free_linklist(list);system("pause");return 0;
}

?

總結

以上是生活随笔為你收集整理的【C++】【四】企业链表的全部內容，希望文章能夠幫你解決所遇到的問題。

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