#include <stdio.h>#include <math.h>#include <cstring>#include <memory.h>#include <malloc.h>//節點的定義typedef struct Node { void *data; //數據域 //鏈域 struct Node *next;} NodeStruct, *pNode;pNode head = NULL; typedef char (*pCompareFunc)(void *a, void *b);typedef void* (*pChar)(void *p);// 字符串判斷int str_compare(void *a, void *b) { char *pa = (char*)a; char *pb = (char*)b; return strcmp(pa , pb);}// 分配一個節點pNode allocate_node(void *data, pChar char_func) { pNode node = allocate(); node->data = char_func(data); return node;}// 創建節點pNode allocate() { void *p = malloc(sizeof(NodeStruct)); pNode node = (pNode)p; node->next = NULL; node->data = NULL; return node;}// 添加一個節點void insertNode(pNode node){ if (head == null){  head=node;  }  else {  node->next = head;  head = node;  }}void* char_char(void *p) { char* pa = (char*)malloc(sizeof(char)); memcpy(pa, p, sizeof(char)); return pa;}// 初始化節點pNode allocate_node(void *data, pChar char_func) { pNode node = allocate(); node->data = char_func(data); return node;}    // 釋放資源void free_list(pNode node) { pNode next = node; while (next != NULL) {  if (next->data != NULL)   free(next->data);  pNode temp = next;  next = next->next;  free(temp); }}// 1.1 添加一個節點void insert(pNode node) { if (head == NULL)  head = node; else {  node->next = head;  head = node; }}//1.2查找int str_search(void* data,pCompareFunc compare){ pNode next = head; pNode prev = NULL; while (next != NULL ) {  if (compare(data, next->data) == 0) {   // 如果查找到了，就退出返回1   return 1;   break;  }  prev = next;  next = next->next; } // 如果一直查找不到，就返回0 return 0;}// 1.3刪除節點void remove(void* data,pCompareFunc compare) { pNode next = head; pNode prev = NULL; while (next != NULL) {  if (compare(data, next->data) == 0) {   if (prev == NULL) {    head = next->next;    next->next = NULL;    free_list(next);   } else {    prev->next = next->next;    next->next = NULL;    free_list(next);   }   break;  }  prev = next;  next = next->next; }}//1.4反轉void invert_order(){  node *This,*prev;  p=head.next;  This=NULL;  while(p) {    prev=This;    This=p;    p=p->next;    This->next=prev;  }  head.next=This;}   void main(){ // 1單向鏈表 char a1[] = 'aaa1'; char a2[] = 'aaa2'; char a3[] = 'aaa3'; // 1.1添加 insertNode(allocate_node(a1, init_char)); insertNode(allocate_node(a2, init_char)); insertNode(allocate_node(a3, init_char)); // 1.2查找 int flag = 0; flag = str_search(&a2,str_compare); // 1.3刪除 remove(&a2,str_compare); // 1.4反轉  invert_order();}