[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个元素，将每组的k个元素翻转1->2->3变成3->2->1。如果最后一个分组的元素小于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) {
        if (head == NULL || head->next == NULL || k == 0 || k == 1)return head;
        ListNode* first = head;
        ListNode* second = head;

        for (int i = 0; i < k - 1 && second != NULL; i++) second = second->next;
        if (second == NULL)return head;

        ListNode* nextHead = second->next;
        second->next = NULL;
        nextHead = reverseKGroup(nextHead, k);
        ListNode* prev = NULL;
        ListNode* curr = head;
        ListNode* next;
        while (curr != NULL) {
            next = curr->next;
            curr->next = prev;
            prev = curr;
            curr = next;    
        }
        head->next = nextHead;
        return prev;
    }
};