【重点】LeetCode 143. Reorder List

LeetCode 143. Reorder List

Solution1：
参考网址：http://www.cnblogs.com/grandyang/p/4254860.html
这段代码有值得学习的三个点：
（1）快慢指针找链表的中间结点
（2）简约的迭代版的翻转链表写法
（3）链表的插入

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    void reorderList(ListNode *head) {
        if (!head || !head->next || !head->next->next) return;
        ListNode *fast = head;
        ListNode *slow = head;
        //把链表从中间分开
        while (fast->next && fast->next->next) {
            slow = slow->next;
            fast = fast->next->next;
        }
        ListNode *mid = slow->next;
        slow->next = NULL;
        ListNode *last = mid;
        ListNode *pre = NULL;
        //翻转链表
        while (last) {
            ListNode *next = last->next;
            last->next = pre;
            pre = last;
            last = next;
        }
        //把第二个链表插入到第一个链表的结点之间
        while (head && pre) {
            ListNode *next = head->next;
            head->next = pre;
            pre = pre->next;
            head->next->next = next;
            head = next;
        }
    }
};