letcode剑指offer24反转链表

题目： https://leetcode-cn.com/problems/fan-zhuan-lian-biao-lcof/submissions/

思路;反转链表

   ListNode* reverseList(ListNode* head) {
   /* 写法一：    if (head == NULL)
                 return NULL;
          ListNode*t = NULL;
          ListNode*p = head->next;
          ListNode*q = head->next->next;
          while (q) {
                 t = q->next;
                 q->next = p;
                 p = q;
                 q = t;
          }
          head->next->next = NULL;
          head->next = p;
          return head;*/
     写法二：     ListNode*prev = NULL;
          ListNode*p = head;
          while (p) {
                 ListNode*temp = p->next;
                 p->next = prev;
                 prev = p;
                 p = temp;
                       
          }
          return prev;
   }

};