LeetCode143 重排链表

给定一个单链表 L：L0→L1→…→Ln-1→Ln ，
将其重新排列后变为： L0→Ln→L1→Ln-1→L2→Ln-2→…

你不能只是单纯的改变节点内部的值，而是需要实际的进行节点交换。

示例 1:

给定链表 1->2->3->4, 重新排列为 1->4->2->3.
示例 2:

给定链表 1->2->3->4->5, 重新排列为 1->5->2->4->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) 
            return;
        
        ListNode* fast = head, *slow = head;
        while(fast->next && fast->next->next){
            slow = slow->next;
            fast = fast->next;
            fast = fast->next;
        }
        
        ListNode* head1 = head;
        ListNode* head2 = slow->next;
        slow->next = NULL;
        
        head2 = reverse(head2);
        ListNode* dummyHead = new ListNode(-1);
        ListNode* cur = dummyHead, *cur1 = head1, *cur2 = head2;
        for(int i = 0; cur1 || cur2; i++)
            if(i % 2 == 0){
                cur->next = cur1;
                cur = cur->next;
                cur1 = cur1->next;
            }
            else{
                cur->next = cur2;
                cur = cur->next;
                cur2 = cur2->next;
            }
        
        head = dummyHead->next;
    }
    
private:
    ListNode* reverse(ListNode* node){
        
        if(!node->next)
            return node;
        
        ListNode* ret = reverse(node->next);
        node->next->next = node;
        node->next = NULL;
        
        return ret;
    }
};