反转链表 --剑指offer

#include<stdio.h>
#include<malloc.h>

typedef struct node
{
    int Element;
    struct node *Link;
}Node;


Node *ReverseList(Node *first)
{
    Node *NewFirst,*p;
    if(first==NULL||first->Link==NULL)
    {
        return first;
    }
    NewFirst=first;
    while(first->Link!=NULL)
    {
        p=first->Link;
        first->Link=p->Link;
        p->Link=NewFirst;
        NewFirst=p;
    }
    return NewFirst;

}

void main()
{    
    int i=0;
    Node *p,*q,*first=NULL;
    while(i<10)
    {
        p=(Node*)malloc(sizeof(Node));
        p->Element=i;
        if(!first)
        {
            first=p;
            first->Link=NULL;
        }
        else
        {
            p->Link=first;
            first=p;
        }
        i++;
    }
    q=first;
    while(q)
    {
        printf("%d,",q->Element);
        q=q->Link;
        
    }
    printf("\n");

    p=ReverseList(first);
    while(p!=NULL)
    {
        printf("%d,",p->Element);
        p=p->Link;
    }
    
}