推 sustainer123: 大師 09/08 11:53
→ sustainer123: 週賽好難哦== 09/08 11:53
→ dont: 我睡過頭了 要參加週賽好難 09/08 11:54
推 sustainer123: 我感覺我要掉分了 早知道睡過頭 09/08 11:55
725. Split Linked List in Parts
## 思路
先計算node的數量,
除k得到每堆的node數量, 剩下的餘數平均給前r堆
## Code
```python
class Solution:
def splitListToParts(self, head: Optional[ListNode], k: int) ->
List[Optional[ListNode]]:
curr = head
count = 0
while curr:
count += 1
curr = curr.next
count, remains = divmod(count, k)
res = []
curr = head
for i in range(k):
res.append(curr)
for _ in range(count+(i < remains)-1):
curr = curr.next
if curr:
curr.next, curr = None, curr.next
return res
```
--
https://i.imgur.com/kyBhy6o.jpeg
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 185.213.82.191 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1725767540.A.287.html