-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolution.py
48 lines (39 loc) · 1.04 KB
/
solution.py
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
39
40
41
42
43
44
45
46
47
48
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def splitListToParts(self, root, k):
"""
:type root: ListNode
:type k: int
:rtype: List[ListNode]
"""
res = []
length = 0
p = root
while p:
p = p.next
length += 1
quotient = length / k
remainder = length % k
p = root
pre = p
i = 0
while p:
if i == 0:
res.append(p)
i += 1
pre = p
p = p.next
if remainder > 0 and i == quotient + 1:
remainder -= 1
pre.next = None
i = 0
elif remainder == 0 and i == quotient:
pre.next = None
i = 0
while len(res) < k:
res.append(None)
return res