重序链表

• 原链表: L0→L1→…→Ln-1→Ln,
• 颠倒后: L0→Ln→L1→Ln-1→L2→Ln-2→…
• 先找到中点（快慢指针），然后后半颠倒，然后将二者插入即可

class Solution {
public:
    void reorderList(ListNode* head) {
        if(!head || !head->next) return;
        ListNode * fastNode = head, * slowNode = head;
        while(fastNode->next){
            fastNode = fastNode->next;
            if(fastNode->next){
                slowNode = slowNode->next;
                fastNode = fastNode->next;
            }
        }
        ListNode * p1 = head;
        ListNode * p2 = slowNode->next;
        slowNode->next = NULL;//将前一段链表的最后一个节点的下一个赋为值NULL
        //将第二个节点指向的链表颠倒过来
        ListNode * prev = NULL;
        ListNode * curr = p2;
        ListNode * tmpNode = NULL;
        while(curr){
            tmpNode = curr->next;
            curr->next = prev;
            prev = curr;
            curr = tmpNode;
        }
        p2 = prev;//颠倒之后的首节点
        ListNode * tmpNode1, * tmpNode2;
        while(p2){
            tmpNode1 = p1->next;
            p1->next = p2;
            tmpNode2 = p2->next;
            p2->next = tmpNode1;
            p1 = tmpNode1;
            p2 = tmpNode2;
        }
    }
};