合并 k 个排序链表,返回合并后的排序链表。请分析和描述算法的复杂度。
示例:
输入:[ 1->4->5, 1->3->4, 2->6 ]输出: 1->1->2->3->4->4->5->6
# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object):
def mergeKLists(self, lists):
"""
:type lists: List[ListNode]
:rtype: ListNode
"""
#合成一个大的listlist然后排序
lists = [x for x in lists if x] if not lists or all([not x for x in lists]): return
head = lists.pop()
curr = head while curr.next:
curr = curr.next
while lists:
tmp = lists.pop()
curr.next = tmp while tmp.next:
tmp = tmp.next
curr = tmp
if not head or not head.next: return head return self.mergeSort(head)
def mergeSort(self, head):
if not head.next: return head
pre, slow, fast = None, head, head
while fast and fast.next:
prev, slow, fast = slow, slow.next, fast.next.next
prev.next = None
left = self.mergeSort(head)
right = self.mergeSort(slow) return self.merge(left, right)
def merge(self, left, right):
if not left: return right if not right: return left
if left.val < right.val:
res = left
res.next = self.merge(left.next, right) else:
res = right
res.next = self.merge(left, right.next) return res
来自 “ ITPUB博客 ” ,链接:http://blog.itpub.net/31551893/viewspace-2644529/,如需转载,请注明出处,否则将追究法律责任。
转载于:http://blog.itpub.net/31551893/viewspace-2644529/