leetcode题解记录-23 合并k个升序链表（python3）

最新推荐文章于 2021-08-03 14:43:05 发布

Cris_Lee卡卡卡

最新推荐文章于 2021-08-03 14:43:05 发布

阅读量142

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/lrs1353281004/article/details/118157604

版权

leetcode 专栏收录该内容

41 篇文章 0 订阅

订阅专栏

题目

23 合并k个升序链表
题目链接
 官方题解

代码记录

from typing import List
class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next
class Solution:
    def resort(self,lists):
        lists = [n for n in lists if n]
        if len(lists)<=1:
            return lists
        cur = lists[0].val
        left = 1
        right = len(lists)-1
        while left<=right:
            mid = (left+right)//2
            if lists[mid].val <= cur:
                left = mid+1
            else:
                right = mid-1
        target = (left+right)//2
        return lists[1:target+1]+[lists[0]]+lists[target+1:]

    def mergeKLists(self, lists: List[ListNode]) -> ListNode:
        lists = [n for n in lists if n]
        if not lists:
            return None
        lists.sort(key= lambda x:x.val)
        head = ListNode(0)
        cur = head
        while lists:
            cur.next = ListNode(lists[0].val)
            cur = cur.next
            lists[0]=lists[0].next
            lists=self.resort(lists)
        return head.next
#测试用例
L1=ListNode(1)
L1.next=ListNode(4)
L1.next.next=ListNode(5)
L2=ListNode(1)
L2.next=ListNode(3)
L2.next.next=ListNode(4)
L3=ListNode(2)
L3.next=ListNode(6)

S=Solution()
res=S.mergeKLists([L1,L2,L3])