用C递归地从链表中删除元素

typedef struct Node {
    int data;
    struct Node* next;
} Node;

Node* deleteNode(Node* head, int target) {
    // 如果链表为空，直接返回
    if (head == NULL) {
        return head;
    }
    
    // 如果头节点是目标元素，删除头节点并返回新的头节点
    if (head->data == target) {
        Node* newHead = head->next;
        free(head);
        return newHead;
    }
    
    // 递归删除下一个节点
    head->next = deleteNode(head->next, target);
    
    return head;
}

#include <stdio.h>
#include <stdlib.h>

typedef struct Node {
    int data;
    struct Node* next;
} Node;

Node* deleteNode(Node* head, int target) {
    if (head == NULL) {
        return head;
    }
    
    if (head->data == target) {
        Node* newHead = head->next;
        free(head);
        return newHead;
    }
    
    head->next = deleteNode(head->next, target);
    
    return head;
}

void printList(Node* head) {
    Node* current = head;
    while (current != NULL) {
        printf("%d ", current->data);
        current = current->next;
    }
    printf("\n");
}

int main() {
    // 创建链表
    Node* head = (Node*)malloc(sizeof(Node));
    head->data = 1;
    
    Node* node1 = (Node*)malloc(sizeof(Node));
    node1->data = 2;
    head->next = node1;
    
    Node* node2 = (Node*)malloc(sizeof(Node));
    node2->data = 3;
    node1->next = node2;
    
    node2->next = NULL;
    
    // 删除元素
    int target = 2;
    head = deleteNode(head, target);
    
    // 打印链表
    printList(head);
    
    // 释放内存
    free(node2);
    free(node1);
    free(head);
    
    return 0;
}