[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.

If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.

You may not alter the values in the nodes, only nodes itself may be changed.

Only constant memory is allowed.

For 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

这道题是k个一组倒序链表中节点，题目难度为Hard。

给链表倒序相信难不到大家，题目复杂的地方在于分组之间的衔接以及最后一个分组的处理。分组间衔接用两个指针分别记录前一个分组和当前分组倒序后的最后一个节点（即该分组的第一个节点），通过这两个指针来完成分组间衔接。最后一个分组如果不够k个节点，再将它倒序一次以恢复原来的顺序。需要考虑的边界情况较多，在写完代码之后要检查一下以下五种情况是否会出错：

• 空链表；
• 节点个数小于k的链表；
• 节点个数等于k的链表；
• 结点个数大于k且最后一个分组节点数小于k的链表；
• 结点个数大于k且最后一个分组节点数等于k的链表；

如果以上情都能够照顾到，那代码应该没什么问题了。具体代码：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseKGroup(ListNode* head, int k) {
        ListNode* curr = head;
        ListNode* prev = NULL;
        ListNode* cTail = head;
        ListNode* pTail = NULL;
        int cnt = 0;
        
        head = NULL;
        while(curr) {
            if(cnt == k) {
                if(!head) head = prev;
                if(pTail) pTail->next = prev;
                prev = NULL;
                pTail = cTail;
                cTail = curr;
                cnt = 0;
            }
            ListNode* temp = curr;
            curr = curr->next;
            temp->next = prev;
            prev = temp;
            ++cnt;
        }
        if(cnt != k) {
            curr = prev;
            prev = NULL;
            while(curr) {
                ListNode* temp = curr;
                curr = curr->next;
                temp->next = prev;
                prev = temp;
            }
        }
        else cTail->next = NULL;
        if(!head) head = prev;
        if(pTail) pTail->next = prev;
        
        return head;
    }
};