Leetcode25. K 个一组翻转链表 -hot100-codeTop

题目：

---

代码(首刷看解析 2024年3月5日）：

/**
 * 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 reverse(ListNode* head) {
        ListNode* pre = nullptr;
        ListNode* cur = head;
        ListNode* next = nullptr;
        while (cur) {
            next = cur->next;
            cur->next = pre;
            pre = cur;
            cur = next;
        }
    }
    ListNode* reverseKGroup(ListNode* head, int k) {
        ListNode* dummyHead = new ListNode(0, head);
        ListNode* pre = dummyHead;
        ListNode* end = dummyHead;
        while (end != nullptr) {
            for (int i = 0; i < k && end != nullptr; ++i) end = end->next;
            if (!end) break;
            ListNode* start = pre->next;
            ListNode* next = end->next;
            end->next = nullptr;
            reverse(start);

            pre->next = end;
            start->next = next;
            
            pre = start;
            end = pre;
        }
        return dummyHead->next;
    }
};

---

代码（二刷看解析 2024年7月26日）

/**
 * 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:
    // 反转链表
    void myReverse(ListNode* head) {
        ListNode* pre = nullptr;
        ListNode* cur = head;
        while (cur) {
            ListNode* temp = cur->next;
            cur->next = pre;
            pre = cur;
            cur = temp;
        }
    }
public:
    // pre -> start -> end -> nextStart
    ListNode* reverseKGroup(ListNode* head, int k) {
        if (!head) return nullptr;
        auto dummyHead = new ListNode(0, head);
        auto pre = dummyHead;
        auto end = dummyHead;
        while (end != nullptr) {
            for (int i = 0; i < k && end != nullptr; i++) end = end->next;
            if (!end) break;//保留原有顺序
            auto start = pre->next;
            auto nextStart = end->next;

            end->next = nullptr;
            myReverse(start);
            pre->next = end;
            start->next = nextStart;
            
            // 更新
            pre = start;
            end = start;
        }
        return dummyHead->next;
    }
};