leetcode 25. Reverse Nodes in k-Group

Description:
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.

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推广于不限于2

Solution:
1、按照题意，首先需要计算还未handle的链表的长度是否大于等于k，如果小于k就可以直接break
2、如果链表长度还大于等于k，那么就是对k个节点进行链表的倒置。这里我采用的是递归算法。

class Solution {
public:
    ListNode* reverseKGroup(ListNode* head, int k) {
        int count=0;
        if(k==1)
            return head;
        ListNode* temp=head;
        bool greater=false;
        while(temp&&!greater)
        {
            count++;
            temp=temp->next;
            if(count==k)
                greater=true;
        }//test whether the length is greater or equal to k
        if(!greater)
            return head;
        count=1;
        ListNode* pre=head;
        temp=head->next;
        while(count!=k)
        {
            ListNode* t=temp->next;
            temp->next=pre;
            pre=temp;
            temp=t;
            count++;
        }//reverse k nodes
        head->next=reverseKGroup(temp,k);//the rest go into recursive
        return pre;
    }
};