单链表就地转置

#include<stdio.h>
#include<stdlib.h>
typedef struct Node{
    char data;
    struct Node *next;
}Node, *LinkedList;

LinkedList insert(LinkedList head, Node *node, int index){
    if(head == NULL){
        if(index != 0){
            return head;
        }
    }
    if(index == 0){
        node->next = head;
        head = node;
        return head;
    }
    Node *current_node = head;
    int count = 0;
    while(current_node->next != NULL && count < index -1){
        current_node = current_node->next;
        count++;
    }
    if(count == index -1){
        node->next = current_node->next;
        current_node->next = node;
    }
    return head;
}
LinkedList reverse(LinkedList head){
    if(head == NULL){
        return head;
    }
    Node *current_node, *next_node;
    current_node = head->next;
    head->next = NULL;
    while(current_node != NULL){
        next_node = current_node->next;
        current_node->next = head;
        head = current_node;
        current_node = next_node;
        
    }
    return head; 
}
void output(LinkedList head){
    if(head == NULL){
        return;
    }
    Node *current_node = head;
    while(current_node != NULL){
        
        if(current_node != head){
           printf(" ");
        }
        printf("%c",current_node->data);
        current_node = current_node->next;
    }
}



int main(){
    int n;
    scanf("%d\n", &n);
    LinkedList linkedlist = NULL;
    for(int i = 0; i < n; i++){
        Node *node = (Node *)malloc(sizeof(Node));
        scanf("%c ", &node->data);
        //printf("%c\n",node->data);
        node->next = NULL;
        linkedlist = insert(linkedlist, node, i);
    }
    linkedlist = reverse(linkedlist);
    output(linkedlist);
    return 0;
}