leetcode 23 合并K个升序链表 24 两两交换链表中的节点

leetcode 23 合并K个升序链表 24 两两交换链表中的节点

23. 合并K个升序链表

难度困难1327收藏分享切换为英文接收动态反馈

给你一个链表数组，每个链表都已经按升序排列。

请你将所有链表合并到一个升序链表中，返回合并后的链表。

示例 1：

输入：lists = [[1,4,5],[1,3,4],[2,6]]
输出：[1,1,2,3,4,4,5,6]
解释：链表数组如下：
[
  1->4->5,
  1->3->4,
  2->6
]
将它们合并到一个有序链表中得到。
1->1->2->3->4->4->5->6

示例 2：

输入：lists = []
输出：[]

示例 3：

输入：lists = [[]]
输出：[]

提示：

• k == lists.length
• 0 <= k <= 10^4
• 0 <= lists[i].length <= 500
• -10^4 <= lists[i][j] <= 10^4
• lists[i] 按 升序 排列
• lists[i].length 的总和不超过 10^4

# Definition for singly-linked list.
# -*- coding: utf-8 -*-
from typing import List

from leetcode.tool import make_list, print_node
class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

class Solution:
    """116 ms  17.6 MB"""
    def mergeKLists3(self, lists: List[ListNode]) -> ListNode:
        length = len(lists)
        if length <= 0:
            return None
        def mergeList(l1: ListNode, l2: ListNode):
            if not l1:
                return l2
            if not l2:
                return l1
            prev = node = ListNode(0)
            while l1 and l2:
                if l1.val <= l2.val:
                    prev.next = l1
                    l1 = l1.next
                else:
                    prev.next = l2
                    l2 = l2.next
                prev = prev.next
            prev.next = l1 if l1 else l2
            return node.next

        while len(lists) != 1:
            arr = []
            for i in range(len(lists)):
                if i % 2 == 0:
                    if i + 1 >= len(lists):
                        arr.append(lists[i])
                    else:
                        l1 = mergeList(lists[i], lists[i + 1])
                        arr.append(l1)
            lists = arr
        return lists[0]

    """
    76 ms  17.6 MB
    """
    def mergeKLists(self, lists: List[ListNode]) -> ListNode:
        length = len(lists)
        if length <= 0:
            return None
        arr = []
        for i in range(length):
            while lists[i]:
                arr.append(lists[i].val)
                lists[i] = lists[i].next
        if len(arr)<=0:
            return None
        arr.sort()
        arr2 = []
        for i in arr:
            arr2.append(ListNode(i))
        for i in range(1,len(arr2)):
            arr2[i-1].next = arr2[i]
        return arr2[0]

if __name__ == '__main__':
    a = [[3,4,5,6],[1,2,4]]
    b = []
    for i in a:
        b.append(make_list(i))
    c = Solution().mergeKLists3(b)
    print_node(c)

24. 两两交换链表中的节点

难度中等929收藏分享切换为英文接收动态反馈

给定一个链表，两两交换其中相邻的节点，并返回交换后的链表。

你不能只是单纯的改变节点内部的值，而是需要实际的进行节点交换。

示例 1：

输入：head = [1,2,3,4]
输出：[2,1,4,3]

示例 2：

输入：head = []
输出：[]

示例 3：

输入：head = [1]
输出：[1]

提示：

• 链表中节点的数目在范围 [0, 100] 内
• 0 <= Node.val <= 100

**进阶：**你能在不修改链表节点值的情况下解决这个问题吗?（也就是说，仅修改节点本身。）

import copy

from leetcode.tool import make_list, print_node


class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next
class Solution:
    """36 ms   14.7 MB"""
    def swapPairs(self, head: ListNode) -> ListNode:
        d = ListNode(0)
        d.next = head
        temp = d
        while temp.next and temp.next.next:
            one = temp.next
            two = temp.next.next
            three = two.next
            temp.next = two
            one.next = three
            two.next = one
            temp = one
        return d.next

    """    48 ms  14.9 MB"""
    def swapPairs2(self, head: ListNode) -> ListNode:
        i = 0
        arr = []
        if not head or not head.next:
            return head
        while head:
            if i % 2 == 1:
                arr.insert(i-1,head)
            else:
                arr.append(head)
            head = head.next
            i += 1
        for i in range(1, len(arr)):
            arr[i-1].next = arr[i]
        arr[len(arr)-1].next = None
        return arr[0]


if __name__ == '__main__':
    a = [1,4,6,7,8,9]
    a = make_list(a)
    c = Solution().swapPairs(a)
    print_node(c)
           arr[i-1].next = arr[i]
        arr[len(arr)-1].next = None
        return arr[0]


if __name__ == '__main__':
    a = [1,4,6,7,8,9]
    a = make_list(a)
    c = Solution().swapPairs(a)
    print_node(c)