翻转链表

ListNode* Reverse(ListNode *head) {
ListNode *reHead = NULL;
ListNode *prev = NULL;
ListNode *Node = head;
while(Node != NULL) {
ListNode *next = Node->next;
if(next == NULL)
reHead = Node;
Node->next = prev;
prev = Node;
Node = next;
}
return reHead;
 }

ListNode* reverse(ListNode *head){
if(head == NULL || head->next == NULL )
return head;
ListNode* tmp = reverse(head->next);
head->next->next = head;
head->next = NULL;
return tmp;
}