23. 合并 K 个升序链表

Python ml

于 2024-08-08 16:24:08 发布

阅读量43

点赞数 1

分类专栏： LeetCode 文章标签：链表 python 数据结构

本文链接：https://blog.csdn.net/m0_48711099/article/details/141030249

版权

LeetCode 专栏收录该内容

168 篇文章 0 订阅

订阅专栏

class Solution:
    def mergeKLists(self, lists: List[Optional[ListNode]]) -> Optional[ListNode]:
        dummy = ListNode()
        cur = dummy
        def __lt__(self, other):
            return self.val < other.val
        ListNode.__lt__ = __lt__
        h = []
        for i in lists:
            if i:
                heapq.heappush(h, i)
        while h:
            node = heapq.heappop(h)
            cur.next = ListNode(node.val)
            cur = cur.next
            if node.next:
                heapq.heappush(h, node.next)
        return dummy.next