lky-leetcode
diff --git a/‎.DS_Store
0 Bytes b/‎.DS_Store
0 Bytes
diff --git a/‎hard/.DS_Store
0 Bytes b/‎hard/.DS_Store
0 Bytes
diff --git a/‎hard/priority_queue/23.合并k个排序链表.py
Lines changed: 33 additions & 0 deletions b/‎hard/priority_queue/23.合并k个排序链表.py
Lines changed: 33 additions & 0 deletions
@@ -0,0 +1,33 @@
+#
+# @lc app=leetcode.cn id=23 lang=python3
+#
+# [23] 合并K个排序链表
+#
+
+# @lc code=start
+# 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: List[ListNode]) -> ListNode:
+        if not lists or len(lists) == 0:
+            return None
+        import heapq
+        heap = []
+        for node in lists:
+            while node:
+                heapq.heappush(heap, node.val)
+                node = node.next
+        dummy = ListNode(None)
+        cur = dummy      
+        while heap:
+            temp_node = ListNode(heappop(heap))
+            cur.next = temp_node
+            cur = temp_node
+        return dummy.next
+
+# @lc code=end
+