合并K个升序链表

草莓味的狮子座leo

于 2021-04-17 21:08:04 发布

阅读量120

点赞数

分类专栏：腾讯精选练习50题文章标签：归并排序

本文链接：https://blog.csdn.net/Mikon_0703/article/details/115801324

版权

腾讯精选练习50题专栏收录该内容

12 篇文章 0 订阅

订阅专栏

在这里插入图片描述

1.分治算法(归并排序)

在这里插入图片描述
代码实现

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

class Solution:
    def mergeKLists(self, lists: List[ListNode]) -> ListNode:
        if not lists:return 
        n = len(lists)
        return self.merge(lists, 0, n-1)
    def merge(self,lists, left, right):
        if left == right:
            return lists[left]
        mid = left + (right - left) // 2
        l1 = self.merge(lists, left, mid)
        l2 = self.merge(lists, mid+1, right)
        return self.mergeTwoLists(l1, l2)
    def mergeTwoLists(self,l1, l2):
        if not l1:return l2
        if not l2:return l1
        if l1.val < l2.val:
            l1.next = self.mergeTwoLists(l1.next, l2)
            return l1
        else:
            l2.next = self.mergeTwoLists(l1, l2.next)
            return l2

class Solution:
    def mergeKLists(self, lists: List[ListNode]) -> ListNode:
        n =len(lists)
        if n ==0:return None
        if n ==1:return lists[0]

        mid = n//2
        return self.mergeTwoLists(self.mergeKLists(lists[:mid]),self.mergeKLists(lists[mid:]))


    def mergeTwoLists(self,l1,l2):
        res = ListNode(None)
        node = res
        while l1 and l2:
            if l1.val < l2.val:
                node.next,l1 =l1,l1.next
            else:
                node.next,l2 =l2,l2.next
            
            node =node.next
        
        if l1:
            node.next =l1
        else:
            node.next =l2

        return res.next