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.

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

思路

1. 先反转k+1后的节点
2. 0~k间的节点反转，同时拼接k+1翻转后的部分。

代码

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode ReverseKGroup(ListNode head, int k){
        ListNode cursor = head;
        int count = 0;
        // locate the k+1 node
        while (cursor != null && count != k) 
        { 
            cursor = cursor.next;
            count++;
        }

        if (count == k) //case: exists k nodes
        { 
            //cursor points to (k+1)th Node
            //reverse k+1~end nodes
            cursor = ReverseKGroup(cursor, k);
            //after, cursor points to k+1 NodeList that has been reversed

            //next, reverse 0~k nodes and splice to cursor
            while (count-- > 0) {
                ListNode tmp = head.next; 
                head.next = cursor; 
                cursor = head; 
                head = tmp; 
            }
            head = cursor;
        }
        return head;
    }

}