381. Split Linked List in Parts

Given a linked list and an integer k, split it into k consecutive parts whose sizes are as equal as possible: any two parts differ in size by at most one, and earlier parts are larger than or equal to later parts. Some parts may be empty. Return the parts as a JSON array of arrays. Input: '[list], k'.

Input: '[list], k'.

Output: Array of arrays — the k parts.

Examples

Input: [1,2,3,4,5,6,7,8,9,10], 3
Output: [[1,2,3,4],[5,6,7],[8,9,10]]
Explanation: Sizes 4,3,3.

Input: [1,2,3], 5
Output: [[1],[2],[3],[],[]]
Explanation: Two empty trailing parts.

Input: [1], 1
Output: [[1]]
Explanation: Single part.

Constraints

• 0<=n<=1000
• 1<=k<=50

Asked by