Leetcode - 25. Reverse Nodes in k-Group

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.

k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.

Example:

Given this linked list: 1->2->3->4->5
For k = 2, you should return: 2->1->4->3->5
For k = 3, you should return: 3->2->1->4->5

Note:

• Only constant extra memory is allowed.
• You may not alter the values in the list’s nodes, only nodes itself may be changed.

/**
 * 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* reverseKGroup(ListNode* head, int k) {
        if(head == nullptr)
            return head;

        ListNode* p = head;
        int n = 0;
        while(p)
        {
            n++;
            p = p->next;
        }
        
        int round = n/k; // 计算一共要倒转几轮
        ListNode dummy{-1, head};
        p = &dummy;
        ListNode* prev = p->next;
        ListNode* cur = prev->next;
        
        while(round--)
        {
            for(int i=0; i<k-1 && prev && cur; ++i) // k个元素内部逆转
            {
                prev->next = cur->next;
                cur->next = p->next;
                p->next = cur;
                cur = prev->next;
            }
            
            p = prev; // 下一个group的头指针前一个元素
            prev = prev->next;
            cur = prev ? prev->next : nullptr;
        }
        
        return dummy.next;
    }
};