classSolution{public ListNode[]splitListToParts(ListNode root,int k){int N =0;
ListNode cur = root;while(cur != null){
N++;
cur = cur.next;}int mod = N % k;int part = N / k;
cur = root;
ListNode[] ret =newListNode[k];for(int i=0;cur!=null&&i<k;k++){int[i]= cur;int size = part +(mod-->0?1:0);for(int j=0;j<size-1;j++){
cur = cur.next;}
ListNode next = cur.next;
cur.next = null;
next = cur;}return ret;}}