编程训练第七十四期——重排链表

编程问题：

给定一个单链表 L：L0→L1→…→Ln-1→Ln ，将其重新排列后变为： L0→Ln→L1→Ln-1→L2→Ln-2→…你不能只是单纯的改变节点内部的值，而是需要实际的进行节点交换。

---

示例：

• 给定链表 1->2->3->4, 重新排列为 1->4->2->3.
• 给定链表 1->2->3->4->5, 重新排列为 1->5->2->4->3.

---

解法：

1.线性表
时间复杂度O(N)
空间复杂度O(N)

/**
 * 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:
    void reorderList(ListNode* head) {
        if (!head)
        {
            return;
        }
        vector<ListNode *> temp;
        ListNode *cur = head;
        while (cur)
        {
            temp.push_back(cur);
            cur = cur->next;
        }
        int i = 0, j = temp.size() - 1;
        while (i < j)
        {
            temp[i]->next = temp[j];
            i++;
            if (i == j)
                break;
            temp[j]->next = temp[i];
            j--;
        }
        temp[i]->next = nullptr;
    }
};

2.链表找中间结点+反转+合并
注意到目标链表即为将原链表的左半端和反转后的右半端合并后的结果。
时间复杂度O(N)
空间复杂度O(1)

/**
 * 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 {
private:
    ListNode *findMidNode(ListNode *head)
    {
        ListNode *slow = head;
        ListNode *fast = head;
        while (fast && fast->next)
        {
            slow = slow->next;
            fast = fast->next->next;
        }
        return slow;
    }

    ListNode *reverse(ListNode *head)
    {
        ListNode *pre = nullptr;
        ListNode *cur = head;
        while (cur)
        {
            ListNode *temp = cur->next;
            cur->next = pre;
            pre = cur;
            cur = temp;
        }
        return pre;
    }

public:
    void reorderList(ListNode* head) {
        if (!head)
        {
            return;
        }
        ListNode *mid = findMidNode(head);
        ListNode *l1 = head;
        ListNode *l2 = reverse(mid->next);
        mid->next = nullptr;

        ListNode *temp1;
        ListNode *temp2;
        while (l1 && l2)
        {
            temp1 = l1->next;
            temp2 = l2->next;

            l1->next = l2;
            l1 = temp1;

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