# 2019.7.12:
方法一：两两合并，用的是链表的方法：https://www.cnblogs.com/marvintang1001/p/11173546.html
方法二：用堆的办法, 用python内置的heapq模块实现堆，heapq只能实现最小堆：https://www.jianshu.com/p/e003872fa7b9
用heap.heapify(list) 构建最小堆；
用heap.heappop(heap) 获取堆中的最小值。
构建一个链表，并且返回这个链表的头节点
from heapq import heapify, heappop # 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: h = [] for node in lists: while node: h.append(node.val) node = node.next if len(h) == 0: return h heapify(h) # 原地建堆 root = ListNode(heappop(h)) cur = root while h: node = ListNode(heappop(h)) cur.next = node cur = node return root
leetcode--23:（堆）Merge k Sorted Lists
原文：https://www.cnblogs.com/marvintang1001/p/11176216.html