Reorder List

Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…

You must do this in-place without altering the nodes' values.

For example,
Given {1,2,3,4}, reorder it to {1,4,2,3}.

将链表分成前后各一半的两段。再将后半段倒置。再合并两个链表。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *reverse(ListNode *head)
    {
        if (!head || !head->next) return head;
        ListNode *pre = head, *cur = head->next;
        ListNode *dummy = new ListNode (0);
        dummy->next = head;
        while (cur)
        {
            pre->next = cur->next;
            cur->next = dummy->next;
            dummy->next = cur;
            cur = pre->next;
        }
        return dummy->next;
    }

    void reorderList(ListNode *head) {
        ListNode *n = head;
        if (!head || !head->next) return;
        ListNode *slowPtr = head, *fastPtr = head;
        while (fastPtr->next != NULL)
        {
            fastPtr = fastPtr->next;
            if (fastPtr->next != NULL) fastPtr = fastPtr->next;
            slowPtr = slowPtr->next;
        }
        n = slowPtr->next;
        slowPtr->next = NULL;
        n = reverse(n);
        ListNode *nh = head;
        while (n)
        {
            ListNode *tmp1 = nh->next, *tmp2 = n->next;
            nh->next = n;
            n->next = tmp1;
            nh = tmp1;
            n = tmp2;
        }
        return;
    }
};