单链表逆转
List Reverse( List L){
if (!L) return NULL;
List front=L;
List rear=front->Next;
List tag;
front->Next = NULL; // 要写,否则输出超时。
while (rear){
tag = rear -> Next;
rear -> Next = front;
front = rear;
rear = tag;
}
return front;
}