Split Linked List in Parts

Leetcode 725.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode[] splitListToParts(ListNode root, int k) {
        int originalSize = 0;
        ListNode temp = root;
        while(temp != null){
            originalSize++; 
            temp = temp.next;
        }
        ListNode[] result = new ListNode[k];
        int num = originalSize / k; //each ListNode length 
        int count = originalSize % k; //the length of count ListNode plus 1
        for(int i = 0; i < k;i++){
          int size = num; 
          if(count-- > 0)
            //the length of ListNode plus 1   
            size = num + 1;
          ListNode child = new ListNode(-1);         
          child.next = root;
          ListNode tempNew = child; 
          for(int j = 0; j < size;j++){
             tempNew = tempNew.next; 
          }
          root = tempNew.next;
          tempNew.next = null;
          result[i] = child.next;
        }
        
    return result;
    }
}