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

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

给定一个链表和一个整数K,输出每K个节点反转的链表,不足K个原样返回.要求空间复杂度为常数,不能改变节点的值.

先找到第K个节点,每次把第K个节点移到first节点后,first向后移动一,直到反转完这K个,再找下一个第K个节点.

如K = 4 时,

public class A25ReverseNodesinkGroup {
	public ListNode reverseKGroup(ListNode head, int k) {
        if(head == null || head.next == null || k <= 1)
        	return head;
        ListNode beforeHead = new ListNode(0);
    	beforeHead.next = head;
    	ListNode first = beforeHead;
    	ListNode second,third,fourth;
    	loop1:while(first != null) {
    		second = first.next;
    		third = findKthNode(first, k);
    		if(third == null || third.next == null)
    			break loop1;
    		fourth = third.next.next;
    		int count = k;
    		while(count > 1) {
    			first.next = third.next;
    			third.next = fourth;
    			first.next.next = second;
    			
    			first = first.next;
    			second = first.next;
    			count--;
    			third = findKthNode(first, count);
    		}
    		first = second;
    	}
    	return beforeHead.next;
    }
	
	public ListNode findKthNode(ListNode head, int k) {
		ListNode ans;
		if(k < 2) return head;
		ans = head.next;
		if(ans == null) return null;
		for(int i = 2; i < k; i++) {
			if(ans.next == null)
				return null;
			ans = ans.next;
		}
		return ans;
	}
}