leetcode725. 分隔链表

def splitListToParts(self, head, k):
        """
        :type head: ListNode
        :type k: int
        :rtype: List[ListNode]
        """
        res = [None]*k
        p = head
        n = 0
        while p:
            n += 1
            p = p.next
        av,re =n//k if n >= k else 1, n % k if n >= k else 0    #计算平均每个数组的长度和余数，注意考虑特殊情况
        p = head
        j = min(n,k)
        for i in range(j):                                      #k次
            res[i] = p                                          #记录每次的头就行
            for i in range(av-1):                               #因为了头节点算一个，所以要减一
                p = p.next
            if re > 0:                                          #余数要补给前面
                re -= 1                                         #最多每次补一个
                p = p.next
            cur = p.next
            p.next = None
            p = cur
        return res