雙鏈表增刪改查

#include <stdio.h>
#include <stdlib.h>// 雙鏈表結點的定義
typedef struct DNode{int data;struct DNode *prev;struct DNode *next;
} DNode;// 創建雙鏈表
DNode *createDoublyLinkedList() {int n, i;printf("請輸入雙鏈表的長度：");scanf("%d", &n);if (n <= 0) {printf("輸入的長度無效！\n");return NULL;}DNode *head = NULL;  // 雙鏈表的頭結點DNode *tail = NULL;  // 雙鏈表的尾結點// 創建雙鏈表的結點for (i = 0; i < n; i++) {int data;printf("請輸入第 %d 個結點的數據：", i+1);scanf("%d", &data);DNode *newNode = (DNode*)malloc(sizeof(DNode));newNode->data = data;newNode->prev = NULL;newNode->next = NULL;if (head == NULL) {head = newNode;tail = newNode;} else {tail->next = newNode;newNode->prev = tail;tail = newNode;}}return head;
}// 遍歷雙鏈表
void traverseDoublyLinkedList(DNode *head) {if (head == NULL) {printf("雙鏈表為空！\n");return;}DNode *current = head;printf("雙鏈表的數據為：");while (current != NULL) {printf("%d ", current->data);current = current->next;}printf("\n");
}// 在指定位置插入結點
void insertNode(DNode **head, int position, int data) {if (*head == NULL) {printf("雙鏈表為空！\n");return;}DNode *current = *head;int currentPosition = 1;// 找到指定位置的結點while (currentPosition < position && current->next != NULL) {current = current->next;currentPosition++;}if (currentPosition < position) {printf("插入位置無效！\n");return;}// 創建新結點DNode *newNode = (DNode*)malloc(sizeof(DNode));newNode->data = data;newNode->prev = NULL;newNode->next = NULL;if (currentPosition == 1) {newNode->next = *head;(*head)->prev = newNode;*head = newNode;} else {newNode->next = current;newNode->prev = current->prev;current->prev->next = newNode;current->prev = newNode;}printf("成功插入結點！\n");
}// 刪除指定位置的結點
void deleteNode(DNode **head, int position) {if (*head == NULL) {printf("雙鏈表為空！\n");return;}DNode *current = *head;int currentPosition = 1;// 找到指定位置的結點while (currentPosition < position && current != NULL) {current = current->next;currentPosition++;}if (current == NULL) {printf("刪除位置無效！\n");return;}if (currentPosition == 1) {*head = (*head)->next;if (*head != NULL) {(*head)->prev = NULL;}} else {current->prev->next = current->next;if (current->next != NULL) {current->next->prev = current->prev;}}free(current);printf("成功刪除結點！\n");
}// 按值查找結點
DNode *searchNode(DNode *head, int data) {if (head == NULL) {printf("雙鏈表為空！\n");return NULL;}DNode *current = head;// 遍歷雙鏈表，找到指定值的結點while (current != NULL) {if (current->data == data) {return current;}current = current->next;}printf("未找到指定結點！\n");return NULL;
}//獲取指定位置數據
int get_node_value(DNode* head, int pos) {if (head == NULL) {  // 判斷鏈表是否為空printf("鏈表為空，無法查找！\n");return -1;}int count = 0;DNode* current = head;while (current != NULL) {if (count == pos) {return current->data;  // 找到指定位置的節點，返回節點的值}count++;current = current->next;  // 繼續遍歷下一個節點}printf("指定位置不存在節點！\n");  // 遍歷完整個鏈表仍然沒有找到節點return -1;
}//查看節點數量
int get_node_count(DNode* head) {int count = 0;DNode* current = head;while (current != NULL) {count++;current = current->next;}return count;
}//打印鏈表數據
void print_list(DNode* head) {DNode* current = head;while (current != NULL) {printf("%d ", current->data);current = current->next;}printf("\n");
}//從尾部添加數據
DNode* create_node(int data) {DNode* newNode = (DNode*)malloc(sizeof(DNode));newNode->data = data;newNode->next = NULL;return newNode;
}
void append_node(DNode** head, int data) {DNode* newNode = create_node(data);if (*head == NULL) {// 如果鏈表為空，則將新節點作為頭節點*head = newNode;} else {// 找到鏈表的末尾節點DNode* current = *head;while (current->next != NULL) {current = current->next;}// 將新節點添加到末尾current->next = newNode;}
}// 釋放雙鏈表的內存
void freeDoublyLinkedList(DNode **head) {DNode *current = *head;while (current != NULL) {DNode *temp = current;current = current->next;free(temp);}*head = NULL;printf("成功釋放雙鏈表的內存！\n");
}int main() {DNode *head = NULL;// 創建雙鏈表head = createDoublyLinkedList();// 遍歷雙鏈表traverseDoublyLinkedList(head);// 在指定位置插入結點int insertPosition, insertData;printf("請輸入要插入的位置和數據（以空格分隔）：");scanf("%d %d", &insertPosition, &insertData);insertNode(&head, insertPosition, insertData);traverseDoublyLinkedList(head);// 刪除指定位置的結點int deletePosition;printf("請輸入要刪除的位置：");scanf("%d", &deletePosition);deleteNode(&head, deletePosition);traverseDoublyLinkedList(head);// 按值查找結點int searchData;printf("請輸入要查找的值：");scanf("%d", &searchData);DNode *searchResult = searchNode(head, searchData);if (searchResult != NULL) {printf("成功找到結點！");}int position;printf("請輸入要查找的位置：");scanf("%d", &position);int value = get_node_value(head, position);if (value == -1) {printf("位置超出鏈表范圍！\n");} else {printf("位置 %d 的值為：%d\n", position, value);}   int count = get_node_count(head);printf("鏈表中共有 %d 個數據節點\n", count);append_node(&head, 30);print_list(head);// 釋放雙鏈表的內存freeDoublyLinkedList(&head);return 0;
}

鏈表帶功能函數

#include <stdio.h>
#include <stdlib.h>typedef struct DNode {int data;void (*Function)(const char*);struct DNode* prev;struct DNode* next;
} DNode;// 創建節點
DNode* createNode(int data, void (*function)(const char*)) {DNode* node = (DNode*)malloc(sizeof(DNode));node->data = data;node->Function = function;node->prev = NULL;node->next = NULL;return node;
}// 插入節點到鏈表末尾
void insertNode(DNode** head, DNode* node) {if (*head == NULL) {*head = node;} else {DNode* current = *head;while (current->next != NULL) {current = current->next;}current->next = node;node->prev = current;}
}// 執行鏈表中的節點功能函數
void executeListFunction(DNode* head, const char* param) {DNode* current = head;while (current != NULL) {if (current->Function != NULL) {current->Function(param);}current = current->next;}
}void executeListFunctions(DNode* head, int searchData, const char* param) {DNode* current = head;while (current != NULL) {if (current->data == searchData && current->Function != NULL) {current->Function(param); //執行對應功能函數。}current = current->next;}
}
// 示例的功能函數
void function1(const char* param) {printf("執行功能函數1，參數：%s\n", param);
}void function2(const char* param) {printf("執行功能函數2，參數：%s\n", param);
}int main() {// 創建節點DNode* node1 = createNode(1, function1);DNode* node2 = createNode(2, function2);// 構建鏈表DNode* head = NULL;insertNode(&head, node1);insertNode(&head, node2);// 執行鏈表中的功能函數executeListFunctions(head, 1, "參數");// 釋放內存free(node1);free(node2);return 0;
}