#include <stdio.h>
#include <stdlib.h>
//定义节点
typedef struct Node {
int data;
struct Node* next;
} Node;
//创建节点
Node* createNode(int data) {
Node* newNode = (Node*)malloc(sizeof(Node));
newNode->data = data;
newNode->next = NULL;
return newNode;
}
//插入节点
void insertAtEnd(Node** head, int data) {
Node* newNode = createNode(data);
if (*head == NULL) {
*head = newNode;
} else {
Node* current = *head;
while (current->next != NULL) {
current = current->next;
}
current->next = newNode;
}
}
//打印链表
void printList(Node* head) {
Node* current = head;
while (current != NULL) {
printf("%d ", current->data);
current = current->next;
}
printf("\n");
}
//删除节点
void deleteNode(Node** head, int data) {
if (*head == NULL) {
return;
}
Node* current = *head;
Node* prev = NULL;
while (current != NULL && current->data != data) {
prev = current;
current = current->next;
}
if (current == NULL) {
return;
} else if (prev == NULL) {
*head = (*head)->next;
} else {
prev->next = current->next;
}
free(current);
}
//查找节点
Node* findNode(Node* head, int data) {
Node* current = head;
while (current != NULL && current->data != data) {
current = current->next;
}
return current;
}
//修改节点
void updateNode(Node* head, int data, int newData) {
Node* current = findNode(head, data);
if (current != NULL) {
current->data = newData;
}
// Node* current = head;
// while (current != NULL && current->data != data) {
// current = current->next;
// }
// if (current != NULL) {
// current->data = newData;
// }
}
//释放内存
//void freeNode(Node* head) {
// Node* current = head;
// Node* next;
// while (current != NULL) {
// next = current->next;
// free(current);
// current = next;
// }
//}
int main() {
Node* head = NULL;
int input;
insertAtEnd(&head, 1);
insertAtEnd(&head, 2);
insertAtEnd(&head, 3);
printList(head);
deleteNode(&head, 2);
printList(head);
updateNode(head, 3, 9);
printList(head);
while (scanf("%d", &input) != EOF) {
insertAtEnd(&head, input);
}
printList(head);
return 0;
}
单链表增删改查C语言
最新推荐文章于 2024-06-11 13:58:52 发布