力扣 143. 重排链表 链表逆序+合并

https://leetcode-cn.com/problems/reorder-list/

思路：首先通过快慢指针得到链表的中点，从中点处断开再将后半部分翻转一下，那么问题就很简单了，逐一合并两个链表即可。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    //翻转链表
    ListNode* reverse(ListNode *head){
        if(!head||!head->next)
            return head;
        ListNode *tmp=reverse(head->next);
        head->next->next=head;
        head->next=nullptr;
        return tmp;
    }
    void reorderList(ListNode* head) {
        if(!head||!head->next)
            return ;
        ListNode *slow=head;
        ListNode *fast=head->next;
        while(fast){
            fast=fast->next;
            if(fast){
                fast=fast->next;
                slow=slow->next;
            }
        }
        ListNode *tmp=slow->next;
        slow->next=nullptr;
        //翻转
        slow=reverse(tmp);
        fast=head->next;
        ListNode *cur=head;
        //合并
        while(fast&&slow){
            cur->next=slow;
            cur=slow;
            slow=slow->next;
            cur->next=fast;
            cur=fast;
            fast=fast->next;
        }
        cur->next=fast?fast:slow;
    }
};