List Reverse( List L )
{
if(L==NULL)
return;
List head=(List)malloc(sizeof(struct Node));
head->Next=NULL;
List q=L,p;
while(q!=NULL)
{
p=q;
q=q->Next;
p->Next=head->Next;
head->Next=p;
}
return head->Next;
}
https://pta.patest.cn/pta/test/15/exam/3/question/724
原文：http://www.cnblogs.com/hutao886/p/5571785.html