import java.util.*;
/*
* public class ListNode {
* int val;
* ListNode next = null;
* }
*/
public class Solution {
/**
*
* @param head ListNode类
* @param k int整型
* @return ListNode类
*/
public ListNode reverseKGroup (ListNode head, int k) {
// write code here
ListNode cur=head;
int count=0;
while(cur!=null||count==k)
{
cur=cur.next;
count++;
}
if(count==k)
{
cur=reverseKGroup(cur,k);
while(count!=0)
{
ListNode tmp=head.next;
head.next=cur;
cur=head;
head=tmp;
}
head=cur;
}
return head;
}
}
`import java.util.*;
/*
* public class ListNode {
* int val;
* ListNode next = null;
* }
*/
public class Solution {
/**
*
* @param head ListNode类
* @param k int整型
* @return ListNode类
*/
public ListNode reverseKGroup (ListNode head, int k) {
// write code here
ListNode cur=head;
int count=0;
while(cur!=null||count==k)
{
cur=cur.next;
count++;
}
if(count==k)
{
cur=reverseKGroup(cur,k);
while(count!=0)
{ count--;
ListNode tmp=head.next;
head.next=cur;
cur=head;
head=tmp;
}
head=cur;
}
return head;
}
}
`