# LWC 58：725. Split Linked List in Parts

## LWC 58：725. Split Linked List in Parts

Problem:

Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list “parts”. The length of each part should be as equal as possible: no two parts should have a size differing by more than 1. This may lead to some parts being null. The parts should be in order of occurrence in the input list, and parts occurring earlier should always have a size greater than or equal parts occurring later. Return a List of ListNode’s representing the linked list parts that are formed. Examples 1->2->3->4, k = 5 // 5 equal parts [ 1, , , , null ]

Example 1:

Input: root = [1, 2, 3], k = 5 Output: [1,,,[],[]] Explanation: The input and each element of the output are ListNodes, not arrays. For example, the input root has root.val = 1, root.next.val = 2, \root.next.next.val = 3, and root.next.next.next = null. The first element output has output.val = 1, output.next = null. The last element output is null, but it’s string representation as a ListNode is [].

Example 2:

Input: root = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], k = 3 Output: [[1, 2, 3, 4], [5, 6, 7], [8, 9, 10]] Explanation: The input has been split into consecutive parts with size difference at most 1, and earlier parts are a larger size than the later parts.

Note:

The length of root will be in the range [0, 1000].

Each value of a node in the input will be an integer in the range [0, 999].

k will be an integer in the range [1, 50].

```    public ListNode[] splitListToParts(ListNode root, int k) {
ListNode[] nodes = new ListNode[k];

for (int i = 0; i < k; ++i) {
nodes[i] = new ListNode(-1);
}

ListNode[] curs = new ListNode[k];
for (int i = 0; i < k; ++i) {
curs[i] = nodes[i];
}

int[] nums = new int[k];

int size = 0;
for (ListNode cur = root; cur != null; cur = cur.next, size++) {
nums[size % k]++;
}

int j = 0;
for (ListNode cur = root; cur != null; cur = cur.next){
curs[j].next = new ListNode(cur.val);
curs[j] = curs[j].next;
nums[j] --;
if (nums[j] == 0) {
j ++;
}
}

for (int i = 0; i < k; ++i) {
nodes[i] = nodes[i].next;
}

return nodes;
}  ```

346 篇文章47 人订阅

0 条评论

## 相关文章

21230

14230

### 【左神算法课】超经典：求两单向链表交点（6种情况）

若一个有环一个无环，直接返回NULL，因为如果他们相交，是不可能一个有环一个无环的（图中情况3）；

16020

9730

### 每天一算：Remove Linked List Elements

LeetCode上第203号问题：Remove Linked List Elements

8730

28390

18830

### LeetCode 203 & 237. Delete Node in a Linked List

Write a function to delete a node (except the tail) in a singly linked list, giv...

14800

2K20

### 【Leetcode】82. 删除排序链表中的重复元素 II

13730 