链表反转，只用两次头插法就实现了 hello

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

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

void add(Link * Head);
void print(Link * Head);
Link* reverse(Link * Head);

int main()
{
    Link *Head = (Link *)malloc(sizeof(Link));
    Head->next = NULL;
    printf("请输入节点的值,输入-1表示结束\n");
    add(Head) ;
    print(Head);
    Head=reverse(Head);

    print(Head);

        getchar();
    return 0;
}
void add(Link * Head)
{
    int data;
    while(~scanf("%d", &data))
    {
        if(data == -1) break;
        Link *L =  (Link *)malloc(sizeof(Link));
        L->data = data;
        if(Head->next == NULL)
        {
            L->next = NULL;
            Head->next = L;
        }
        else
        {
            L->next = Head->next;
            Head->next = L;
        }

    }
}

void print(Link *Head)
{
    Link *p =  (Link *)malloc(sizeof(Link));
    p = Head;
    while(p->next != NULL)
    {

        printf("%d, ", p->next->data);
        p = p->next;
    }
    p = NULL;
    free(p);
    printf("\n");
}

Link* reverse(Link * Head)
{
    Link * NewHead = (Link *)malloc(sizeof(Link));
    NewHead->next = NULL;
    Link *p =  (Link *)malloc(sizeof(Link));
    p = Head;
    while(p->next != NULL)
    {
        Link *L =  (Link *)malloc(sizeof(Link));
        L->data = p->next->data;
        if(NewHead->next == NULL)
        {
            L->next = NULL;
            NewHead->next = L;
        }
        else
        {
            L->next = NewHead->next;
            NewHead->next = L;
        }

        p = p->next;
    }
        p = Head->next;
        Link *p1 =  (Link *)malloc(sizeof(Link));
        p1 = Head->next;
        while(p1->next != NULL)
        {
            p1 = p1->next;
            free(p);
            p = p1 ;
        }
        Head = NewHead;
        NewHead = NULL;
        free(NewHead);
        free(p1);
        p1 = NULL;
        p = NULL;

        return Head;
}