我的链表中第一个节点中的数据一直更改为列表中的最后一个节点。C语言

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

// 定义链表节点结构体
struct Node {
    int data;
    struct Node* next;
};

// 在链表末尾插入节点
void insert(struct Node** head, int data) {
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode->data = data;
    newNode->next = NULL;

    if (*head == NULL) {
        *head = newNode;
    } else {
        struct Node* current = *head;
        while (current->next != NULL) {
            current = current->next;
        }
        current->next = newNode;
    }
}

// 遍历链表并打印节点数据
void printList(struct Node* head) {
    struct Node* current = head;
    while (current != NULL) {
        printf("%d ", current->data);
        current = current->next;
    }
    printf("\n");
}

// 解决问题：将第一个节点的数据更改为最后一个节点的数据
void fixLinkedList(struct Node** head) {
    if (*head == NULL || (*head)->next == NULL) {
        return;
    }

    struct Node* current = *head;
    while (current->next->next != NULL) {
        current = current->next;
    }

    int temp = (*head)->data;
    (*head)->data = current->next->data;
    current->next->data = temp;
}

int main() {
    struct Node* head = NULL;

    // 插入节点
    insert(&head, 1);
    insert(&head, 2);
    insert(&head, 3);
    insert(&head, 4);

    printf("原始链表：");
    printList(head);

    // 解决问题
    fixLinkedList(&head);

    printf("修复后的链表：");
    printList(head);

    return 0;
}