leetcode 725将链表分割成几部分

题目：
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:
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:
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].
题解：
思路：先求得链表的长度L，然后维持两个变量pl(每部分长度),r(冗余长度)分别保存L/k,L%k的值,然后对链表处理k次，每个部分当且仅当r不为0的时候可以额外增加1，然后每次处理完都使r-1,代表冗余部分已经分配了一部分了，每次遍历k个长度，然后断开链表，重复以上步骤k次即可
下面是代码：
python版：
def splitListToParts(self, root, k):
“”"
:type root: ListNode
:type k: int
:rtype: List[ListNode]
“”"
def getL(root):
if not root:return 0
return getL(root.next)+1
L,res,h=getL(root),[],root
pl,r=divmod(L,k)
while h or k:
if h:
res.append(h)
count=pl+1 if r else pl
r=max(0,r-1)
while h and count>1:
h,count=h.next,count-1
h.next,h=None,h.next
else:
res.append(None)
k-=1
return res

更优化的做法：
C++版本：
class Solution {
public:
vector<ListNode*> splitListToParts(ListNode* root, int k) {
int L=0;
for(ListNode node=root;node;node=node->next)
++L;
int pl=L/k,r=L%k;
vector<ListNode> res(k,nullptr);
ListNode *cur=root,*prev=nullptr;
for(int i=0;cur&&i<k;i++,–r)
{
res[i]=cur;
for(int j=0;cur&&j<pl+(r>0);++j)
{
prev=cur;
cur=cur->next;
}
prev->next=nullptr;
}
return res;
}
};