双链表增删改查

#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;
}