［LeetCode］Reverse Linked List

解题思路：

A linked list can be reversed either iteratively or recursively. Could you implement both?

方法一，迭代法：

边界条件：head == NULL

前条件：temphead = head, p = tail, q = tail->next

不变式：head = head->next, 把temphead插入p和q之间

结束条件：head == p

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        if (head == NULL)
            return NULL;

        ListNode *p = head;
        while (p->next != NULL)
            p = p->next;

        ListNode *q = p->next;
        ListNode *tempHead = head;
        while(head != p){
            tempHead = head;
            head = head->next;
            tempHead->next = q;
            p->next = tempHead;
            q = p->next;
        }
        return head;
    }
};

方法二，回溯法：

边界条件：head为NULL

前条件：找到尾节点

结束条件：head为NULL

不变式：寻找尾节点

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        if (head == NULL)
            return NULL;

        if (head->next == NULL)
            return head;

        ListNode *p = head;
        ListNode *q = p->next;
        while(q->next != NULL){
            p = q;
            q = q->next;
        }

        ListNode *newHead = q;
        p->next = q->next;
        q->next = reverseList(head);

        return newHead;
    }
};