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], [2], [3], [4], null ]
Example 1:
|
1 2 3 4 5 6 7 8 |
Input: root = [1, 2, 3], k = 5 Output: [[1],[2],[3],[],[]] 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[0] has output[0].val = 1, output[0].next = null. The last element output[4] is null, but it's string representation as a ListNode is []. |
Example 2:
|
1 2 3 4 5 |
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
rootwill be in the range[0, 1000]. - Each value of a node in the input will be an integer in the range
[0, 999]. kwill be an integer in the range[1, 50].
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
// Author: Huahua // Runtime: 9 ms class Solution { public: vector<ListNode*> splitListToParts(ListNode* root, int k) { int len = 0; for (ListNode* head = root; head; head = head->next) ++len; vector<ListNode*> ans(k, nullptr); int l = len / k; int r = len % k; ListNode* head = root; ListNode* prev = nullptr; for (int i = 0; i < k; ++i, --r) { ans[i] = head; for (int j = 0; j < l + (r > 0); ++j) { prev = head; head = head->next; } if (prev) prev->next = nullptr; } return ans; } }; |
Java
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
// Author: Huahua // Runtime: 4 ms class Solution { public ListNode[] splitListToParts(ListNode root, int k) { ListNode[] ans = new ListNode[k]; int len = 0; for (ListNode head = root; head != null; head = head.next) ++len; int l = len / k; int r = len % k; ListNode prev = null; ListNode head = root; for (int i = 0; i < k; ++i, --r) { ans[i] = head; int part_len = l + ((r > 0) ? 1 : 0); for (int j = 0; j < part_len; ++j) { prev = head; head = head.next; } if (prev != null) prev.next = null; } return ans; } } |
Python
|
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 |
""" Author: Huahua Runtime: 79 ms """ class Solution: def splitListToParts(self, root, k): total_len = 0 head = root while head: total_len += 1 head = head.next ans = [None for _ in range(k)] l, r = total_len // k, total_len % k prev, head = None, root for i in range(k): ans[i] = head for j in range(l + (1 if r > 0 else 0)): prev, head = head, head.next if prev: prev.next = None r -= 1 return ans |
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
huahualeetcode
Be First to Comment