leetcode: 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

原问题链接：https://leetcode.com/problems/reverse-nodes-in-k-group/

 

 

问题分析

    这个问题并不是多难，而是整个调整的过程比较繁琐。

　总体的思路如下，每次设定一个指针pilot往前面移动k步，然后在pilot后面的元素全部都翻转过来。要处理的细节就是翻转链表以及在移动k步的时候如果已经到结尾了要退出循环返回。详细实现的代码如下：

 

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode reverseKGroup(ListNode head, int k) {
        if (head == null || head.next == null || k < 2) return head;
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        ListNode pre = dummy, cur = head;
        while(cur != null) {
            ListNode pilot = pre.next;
            int i = 0;
            for(i = 0; i < k && pilot != null; i++) pilot = pilot.next;
            if (i < k) break;
            while(cur.next != pilot) {
                ListNode nt = cur.next.next;
                cur.next.next = pre.next;
                pre.next = cur.next;
                cur.next = nt;
            }
            pre = cur;
            cur = cur.next;
        }
        return dummy.next;
    }
}