leetcode--合并链表

148. 排序链表

合并单个链表，参数是一个链表头节点

给你链表的头结点 head ，请将其按 升序 排列并返回 排序后的链表

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def sortList(self, head: ListNode) -> ListNode:
        if not head or not head.next:
            return head
        slow, fast = head, head.next#fast必须初始化位head.next,因为如果最后节点数量为2，就没有办法再继续划分节点了
        while fast and fast.next:
            fast = fast.next.next
            slow = slow.next
        head1, slow.next = slow.next, None#z这里注意head1必须是slow。next，因为head是包含slow这个节点的
        left = self.sortList(head)
        right = self.sortList(head1)
        res = self.merge(left, right)
        return res
    def merge(self, left, right):
        res = ListNode()
        ans = res
        while left and right:
            if left.val < right.val:
                res.next = left
                left = left.next
            else:
                res.next = right
                right = right.next
            res = res.next
        res.next = left if left else right

        return ans.next

23. 合并K个升序链表

合并多个链表，参数是一个数组

给你一个链表数组，每个链表都已经按升序排列。
请你将所有链表合并到一个升序链表中，返回合并后的链表。

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution(object):
    def mergeKLists(self, lists):
        """
        :type lists: List[ListNode]
        :rtype: ListNode
        """
        i, j = 0, len(lists)
        if j == 0:
            return
        if j == 1:
            return lists[0]
        mid = (i+j)//2
        a = self.mergeKLists(lists[:mid])
        b = self.mergeKLists(lists[mid:])
        return self.sort_list(a, b)
    def sort_list(self, list1, list2):
        l1, l2, tem = list1, list2, ListNode()
        res = tem
        while l1 and l2:
            if l1.val < l2.val:
                tem.next = l1
                l1 = l1.next
            else:
                tem.next = l2
                l2 = l2.next
            tem = tem.next
        tem.next = l1 if l1 else l2
        return res.next