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.

思路肯定就是说什么做什么，但是这么做到bug free，怎么简单的写出来呢？

可以递归！！！

// 递归+链表原地逆序
class Solution {
    public ListNode reverseKGroup(ListNode head, int k) {
    	int cnt=0;
    	ListNode cur=head;
    	while(cur!=null && cnt!=k) {
    		cur=cur.next;
    		cnt++;
    	}
    	
    	if(cnt<k) return head;
    	
    	cur = reverseKGroup(cur, k);
    	while(cnt-->0) {
    		ListNode tmp=head.next;
    		head.next = cur;
    		cur = head;
    		head = tmp;
    	}
    	return cur;
    }
}