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


/**
 * 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==1) {
            return head;
        }
        ListNode p1 = head;
        ListNode p2 = head;
        ListNode newHead = head;
        ListNode lastTail = null;
        while(p1!=null) {
           
            int t = k;
            while(t>0 && p2!=null) {
                p2 = p2.next;
                t--;
            }
            if(t!=0 && p2==null) {
                return newHead;
            }
            // reverse
            ListNode pt0 = p2;
            ListNode pt1 = p1;
            ListNode pt2 = pt1.next;
           
            while(true) {
                pt1.next = pt0;
                pt0 = pt1;
                pt1 = pt2;
                if(pt1==p2) break;
                pt2 = pt2.next;
            }
            if(newHead==head) {
                newHead = pt0;
            }
            if(lastTail!=null) {
                lastTail.next = pt0;
            }
            lastTail = p1;
            p1 = p2;
        }
        return newHead;
    }
}