23. 合并K个排序链表--PYTHON

分治法

class Solution(object):
    def mergeKLists(self, lists):
        """
        :type lists: List[ListNode]
        :rtype: ListNode
        """
        amount = len(lists)                #保存链表数
        interval = 1                       #合并间隔
        while interval < amount:
            for i in range(0, amount - interval, interval * 2): #每两个间隔合并链表--以下三行是精髓，建议读者画图细细品味
                lists[i] = self.merge2Lists(lists[i], lists[i + interval])
            interval *= 2
        return lists[0] if amount > 0 else lists  #如果amount等于0代表没有链表那么直接返回None即可

    def merge2Lists(self, l1, l2): #两个序列按排序合并
        head = point = ListNode(0)
        while l1 and l2:
            if l1.val <= l2.val:
                point.next = l1
                l1 = l1.next
            else:
                point.next = l2
                l2 = l1
                l1 = point.next.next
            point = point.next
        if not l1:
            point.next=l2
        else:
            point.next=l1
        return head.next

自己

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def mergeKLists(self, lists):
        """
        :type lists: List[ListNode]
        :rtype: ListNode
        """

        node_list = list()
        res_list = ListNode(-1)
        for i in lists:
            p = i
            while True:
                if p:
                    node_list.append(int(p.val))
                    p = p.next
                else:
                    break

        node_list.sort(reverse = True)
        for i in node_list:
            temp = res_list.next
            insert_ = ListNode(i)
            res_list.next = insert_
            insert_.next = temp

        return res_list.next