LeetCode Hot100 25.K个一组翻转链表

/**
 * 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) return nullptr;
        ListNode* pre = nullptr;
        ListNode* cur = head;
        while(cur != nullptr){
            ListNode* next = cur->next;
            cur->next = pre;
            pre = cur;
            cur = next;
        }
        return pre;
    }
    ListNode* reverseKGroup(ListNode* head, int k) {
        if(!head || k == 1) return head;
        ListNode* dummyHead = new ListNode();
        dummyHead -> next = head;
        ListNode* pre = dummyHead;   //已翻转链表的队尾
        ListNode* end = pre;   //待翻转链表的队尾
        ListNode* next = pre;   //待翻转链表的后继
        int count = 0;
        while(1){
            count = 0;
            while(count < k && end != nullptr){
                end = end->next;
                count++;
            }
            if(count != k || end == nullptr) break;
            //保存未翻转链表的起点
            ListNode* next = end->next;
            //保存待翻转链表的起点
            ListNode* start = pre->next;
            //截断当前链表
            end->next = nullptr;
            //flip
            pre->next = reverse(start);  //该函数返回翻转后的链表头部
            start->next = next;//原起点在翻转后变成了尾部
            //更新已翻转链表尾部
            pre = start;
            end = pre; 
        }  
        return dummyHead -> next;
    }
};