026. 重排链表

重排链表：三步走
1.找到中点
2.逆置后半段
3.链接两个链表
注意：要将链表1打断，通过mid->next = null；
https://leetcode-cn.com/problems/LGjMqU/
官方示例：

fast->next != nullptr && fast->next->next != nullptr//只要有一个为空就退出循环

class Solution {
public:
    void reorderList(ListNode* head) {
        if (head == nullptr) {
            return;
        }
        ListNode* mid = middleNode(head);//返回的是中间的，或者中间偏左
        ListNode* l1 = head;
        ListNode* l2 = mid->next; //后半段的起点
        mid->next = nullptr; //前半段和后半段分开了
        l2 = reverseList(l2);//后半段逆置
        mergeList(l1, l2);//合并两段
    }

    ListNode* middleNode(ListNode* head) {
        ListNode* slow = head;
        ListNode* fast = head;
        while (fast->next != nullptr && fast->next->next != nullptr) {  //返回的是中间的，或者中间偏左
            slow = slow->next;
            fast = fast->next->next;
        }
        return slow;
    }

    ListNode* reverseList(ListNode* head) {
        ListNode* prev = nullptr;
        ListNode* curr = head;
        while (curr != nullptr) {
            ListNode* nextTemp = curr->next;
            curr->next = prev;
            prev = curr;
            curr = nextTemp;
        }
        return prev;
    }

    void mergeList(ListNode* l1, ListNode* l2) {
        ListNode* l1_tmp;
        ListNode* l2_tmp;
        while (l1 != nullptr && l2 != nullptr) {  //只要有一个不满足就退出循环。l1比l2长，长的先指
            l1_tmp = l1->next;
            l2_tmp = l2->next;

            l1->next = l2;
            l1 = l1_tmp;

            l2->next = l1;
            l2 = l2_tmp;
        }
    }
};

我的代码

class Solution {
public:
    void reorderList(ListNode* head) {
        //1.找到链表中点，快慢指针
        ListNode *fast = head;
        ListNode *slow = head;
        ListNode *L1 = head;//前半段

        while(fast->next!=NULL && fast->next->next!=NULL)//得到的值：偶数：中间偏左，奇数：中间
        {
            slow = slow->next;
            fast = fast->next->next;
        }
        
        ListNode* l2 = slow->next;
        slow->next = nullptr;//将前半段打断 
        //2.将后半段链表逆置
        ListNode * L2 =NULL;
        while(l2)
        {
            ListNode* temp = l2->next;
            l2->next = L2;
            L2 = l2;
            l2 = temp;
        }
        //new_list2是逆置后的后半段，L1是前半段
        //3.将两个链表连接   L1一定要比L2长1才可以
      
        while(L1!=nullptr && L2!=nullptr)
        {
       
            ListNode* L1_tmp = L1->next;
            ListNode* L2_tmp = L2->next;

            L1->next = L2;
            L1 = L1_tmp;

            L2 -> next = L1;
            L2 = L2_tmp;
         
        }
    }
};