Hard-题目14：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的倍数，则最后一组不用翻转。要求使用常数的空间复杂度。
题目分析：
使用双指针，分别指向头结点（记为p1）和头结点后第k个节点（记为p2，如果长度不足k，则直接返回头结点），翻转p1-p2的部分（又是一个双指针），然后递归翻转p2以后的部分。
源码：（language：cpp）

class Solution {
public:
    ListNode *reverseKGroup(ListNode *head, int k) {
        if (!head || !(head->next) || k < 2)
            return head;

        // count k nodes
        ListNode *nextgp = head;
        for (int i = 0; i < k; i++)
            if (nextgp)
                nextgp = nextgp->next;
            else
                return head;

        // reverse
        ListNode *prev = NULL, *cur = head, *next = NULL;
        while (cur != nextgp) {
            next = cur->next;
            if (prev)
                cur->next = prev;
            else
                cur->next = reverseKGroup(nextgp, k);
            prev = cur;
            cur = next;
        }
        return prev;
    }
};

成绩：
24ms,beats 41.82%，众数24ms,58.05%
Cmershen的碎碎念：
本题非常考验链表指针的细节操作，稍有不慎链表后面的信息就丢失了。