写一个带插入和删除的单向链表
时间: 2023-03-27 18:01:42 浏览: 80
好的,我可以回答这个问题。单向链表是一种常见的数据结构,它由一系列节点组成,每个节点包含一个数据元素和一个指向下一个节点的指针。插入和删除操作可以通过修改节点的指针来实现。具体实现可以参考以下代码:
```
#include <stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node* next;
};
struct Node* createNode(int data) {
struct Node* node = (struct Node*)malloc(sizeof(struct Node));
node->data = data;
node->next = NULL;
return node;
}
void insertNode(struct Node** head, int data) {
struct Node* node = createNode(data);
if (*head == NULL) {
*head = node;
} else {
struct Node* curr = *head;
while (curr->next != NULL) {
curr = curr->next;
}
curr->next = node;
}
}
void deleteNode(struct Node** head, int data) {
if (*head == NULL) {
return;
}
if ((*head)->data == data) {
struct Node* temp = *head;
*head = (*head)->next;
free(temp);
} else {
struct Node* curr = *head;
while (curr->next != NULL && curr->next->data != data) {
curr = curr->next;
}
if (curr->next != NULL) {
struct Node* temp = curr->next;
curr->next = curr->next->next;
free(temp);
}
}
}
void printList(struct Node* head) {
struct Node* curr = head;
while (curr != NULL) {
printf("%d ", curr->data);
curr = curr->next;
}
printf("\n");
}
int main() {
struct Node* head = NULL;
insertNode(&head, 1);
insertNode(&head, 2);
insertNode(&head, 3);
printList(head);
deleteNode(&head, 2);
printList(head);
return ;
}
```