数据结构链表倒序(面试题)

Node* ReverseList(Node *head)
{
 if((head->next == NULL) || (head == NULL))
  return head;
 
 Node *temp1 = head;
 Node *temp2;
 Node *temp3 = temp1->next;
 temp1->next = NULL;
 while(temp3->next != NULL)
 {
  temp2 = temp3;
  temp3 = temp3->next;
  temp2->next = temp1;
  temp1 = temp2;
 }
 temp3->next = temp1;
 return temp3;
}