2023.09.06 Today's Challenge

https://leetcode.com/problems/split-linked-list-in-parts/

Split Linked List in Parts - LeetCode

리스트의 연속

class Solution:
    def splitListToParts(self, head: Optional[ListNode], k: int) -> List[Optional[ListNode]]:
        cur = head
        for n in range(1001):
            if not cur:
                break
            cur = cur.next
        width, remainder = divmod(n, k)

        ans = []
        cur = head
        for i in range(k):
            head = write = ListNode(None)
            for j in range(width + (i < remainder)):
                write.next = write = ListNode(cur.val)
                if cur:
                    cur = cur.next
            ans.append(head.next)
        return ans