Python刷leetcode--23.合并K个排序链表 [链表]

最新推荐文章于 2022-06-14 00:14:57 发布

Biturd

最新推荐文章于 2022-06-14 00:14:57 发布

阅读量498

点赞数

分类专栏： Python 算法与数据结构

本文链接：https://blog.csdn.net/qq_42873554/article/details/106988793

版权

Python 同时被 2 个专栏收录

51 篇文章 0 订阅

订阅专栏

算法与数据结构

51 篇文章 0 订阅

订阅专栏

解法一：

将链表缓存出来，然后排序最后出来

class Solution:
    def mergeKLists(self, lists) -> ListNode:
        # leetcode submit region end(Prohibit modification and deletion)
        my_list = []
        for thelist in lists:
            i = thelist
            while i:  # thelist 是一个list
                my_list.append(i.val)
                i = i.next
        my_list = sorted(my_list)
        head = cur = ListNode(0)
        for i in my_list:
            cur.next = ListNode(i)
            cur = cur.next
        return head.next

if __name__ == '__main__':
    sol = Solution()
    l1, l1.next, l1.next.next = ListNode(1), ListNode(4), ListNode(5)
    l2, l2.next, l2.next.next = ListNode(1), ListNode(3), ListNode(4)
    l3, l3.next = ListNode(2), ListNode(6)
    lists = [l1, l2, l3]
    # lists = []
    ans = sol.mergeKLists(lists)
    while ans:
        print(str(ans.val) + '->')
        ans = ans.next