Reverse Nodes in k-Group LeetCode Java

描述
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 le�-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的倍数，那么最终的节点应该保持原样。
可能不会更改节点中的值，而只能更改节点本身。

例如，给定这个链表：1＞2＞3＞4＞5。
对于k＝2，你应该返回：2 -＞1 -＞4＞3＞5。
对于k＝3，你应该返回：3 -＞2 -＞1＞4＞5。

注意越界问题，

代码

public static ListNode reverseNodeInKGrop(ListNode head, int n) {
        if (head == null || head.next == null || n == 1)
            return head;
        ListNode fakehead = new ListNode(-1);
        fakehead.next = head;
        ListNode ptr1 = head, ptr2 = fakehead.next.next, newstart = fakehead;
        int len = 0;
        while (ptr1 != null) {
            len++;
            ptr1 = ptr1.next;
        }
        ptr1 = fakehead.next;
        if(n!=len)
           n = n % len;
        int k = len / n;
        for (int j = 0; j < k; j++) {

            for (int i = 1; i < n; i++) {
                ptr1.next = ptr2.next;
                ptr2.next = newstart.next;
                newstart.next = ptr2;
                ptr2 = ptr1.next;
            }
            
            for (int i = 0; i < n; i++) {
                newstart = newstart.next;
            }

            if (ptr2 != null && ptr2.next != null) {
                ptr1 = newstart.next;
                ptr2 = ptr1.next;
            }
        }

        return fakehead.next;
    }