单链表逆转

单链表逆转

本题要求实现一个函数，将给定的单链表逆转
函数接口定义：

List Reverse(List L);

其中List结构定义如下:

typedef struct Node *PtrToNode;
strut Node
   {
      ElementType Data;
      PtrToNode Next;
    };
typedef PtrToNode List;

L是给定链表，函数Reverse要返回被逆转后的链表
裁判测试程序样例：

#include <stdio.h>
#include <stdlib.h>
typedef int ElementType;
typedef struct Node *PtrToNode;
struct Node{
    ElementType Data;
    PtrToNode Next;
};
typedef PtrToNode List;

List Read();
void Print(List L);
List Reverse(List L);
int main()
{
    List L1,L2;
    L1 = Read();
    L2 = Reverse(L1);
    Print(L1);
    Print(L2);
    return 0;
}

code:

#include <stdio.h>//未能成功输出结果 
#include <stdlib.h>
typedef int ElementType;
typedef struct Node *PtrToNode;
struct Node{
    ElementType Data;
    PtrToNode Next;
};
typedef PtrToNode List;

List Read();
void Print(List L);
List Reverse(List L);
int main()
{
    List L1,L2;
    L1 = Read();
    L2 = Reverse(L1);
    Print(L1);
    Print(L2);
    return 0;
}

List Read()
{
    int len = 0;
    int num = 0;
    PtrToNode list = NULL;
    PtrToNode last = NULL;

    scanf("%d",&len);
    if( 0== len){
        return NULL;
    }
    scanf("%d",&num);
    list = (PtrToNode)malloc(sizeof(struct Node));
    list->Data = num;
    list->Next = NULL;
    last = list;
    len--;
    while(len > 0){
        scanf("%d",&num);
        PtrToNode node = (PtrToNode)malloc(sizeof(struct Node));
        node->Data = num;
        node->Next = NULL;
        last->Next = node;
        len --;

    }
    return list;
}

void Print(List L){
    if(NULL == L){
        return ;
    }
    PtrToNode last = L;
    while(NULL != last){
        printf("%d",last->Data);
        last = last->Next;
    }
    putchar('\n');

}
List Reverse(List L){
    if(NULL == L){
        return NULL;
    }
    PtrToNode listre = NULL;
    PtrToNode t = L->Next;
    if(NULL == t){
        listre = L;
        return listre;
    }
    L->Next = t->Next;
    listre = t;
    t->Next = L;
    while(NULL != L->Next){
        t = L->Next;
        L->Next = t->Next;
        t->Next = listre;
        listre = t;
    }
    return listre;
}