23. 合并K个排序链表

题目描述请点击查看LeetCode 题目描述

Python3 代码解答如下:

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
import functools

class Solution:
    def cmp(self, node1,node2):
        if node2.val < node1.val:
            #node2放到前面去
            return 1
        elif node2.val > node1.val:
            return -1
        return 0
    
    def mergeKLists(self, lists):
        """
        :type lists: List[ListNode]
        :rtype: ListNode
        """
        li = []
        for i in lists:
            a = i
            while a is not None:
                li.append(a)
                a=a.next
        
        print(len(li))
        #排序列表，按照节点的值，从小到大
        li = sorted(li, key=functools.cmp_to_key(self.cmp))
        
        #循环节点列表，将其拼成新的链表
        listnode = ListNode(0)   #新链表,头结点为0
        c = listnode             #当前节点/指针
        for j in range(0,len(li)):
            c.val = li[j].val
            c.next = None if j == len(li)-1 else li[j+1]
            c = c.next
        
        #当节点列表个数为0时，返回 None
        if len(li) == 0:
            return None
        else:
            return listnode