C 语言实现链表：按序插入、删除及打印数据操作程序

以下是使用 C 语言实现的链表练习程序： ```c #include <stdio.h> #include <stdlib.h> typedef struct { int value; } datastruct_t; typedef struct _list { datastruct_t* pstdata; struct _list* nextptr; } listnode_t; // 打印链表函数 void printlist(listnode_t* head) { listnode_t* current = head; while (current!= NULL) { printf("%d ", current->pstdata->value); current = current->nextptr; } printf("\n"); } // 按数字从大到小顺序插入节点 listnode_t* insertnode(listnode_t* head, int value) { listnode_t* newNode = (listnode_t*)malloc(sizeof(listnode_t)); newNode->pstdata = (datastruct_t*)malloc(sizeof(datastruct_t)); newNode->pstdata->value = value; listnode_t* current = head; listnode_t* prev = NULL; while (current!= NULL && current->pstdata->value > value) { prev = current; current = current->nextptr; } if (prev == NULL) { newNode->nextptr = head; head = newNode; } else { newNode->nextptr = current; prev->nextptr = newNode; } return head; } // 删除指定值的节点 listnode_t* deletenode(listnode_t* head, int value) { listnode_t* current = head; listnode_t* prev = NULL; while (current!= NULL && current->pstdata->value!= value) { prev = current; current = current->nextptr; } if (current == NULL) { printf("Value not found in the list.\n"); return head; } if (prev == NULL) { head = current->nextptr; } else { prev->nextptr = current->nextptr; } free(current->pstdata); free(current); return head; } int main() { listnode_t* head = NULL; int choice; printf("please enter your choice: 1 is to insert an element to the list. 2 is to delete an element from the list. 3 is to quit.\n"); do { printf("? "); scanf("%d", &choice); switch (choice) { case 1: { int value; printf("enter an int to insert: "); scanf("%d", &value); head = insertnode(head, value); printlist(head); break; } case 2: { int value; printf("enter an int to be deleted: "); scanf("%d", &value); head = deletenode(head, value); printlist(head); break; } case 3: break; default: printf("Invalid choice. Please try again.\n"); } } while (choice!= 3); // 释放链表内存 listnode_t* temp; while (head!= NULL) { temp = head; head = head->nextptr; free(temp->pstdata); free(temp); } return 0; } ``` ######[AI写代码神器 | 828点数解答 | 2024-08-26 06:23:19]