链表-LeetCode21. 合并两个有序链表

1、题目描述

https://leetcode-cn.com/problems/merge-two-sorted-lists/

将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 

输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

2、代码详解

进阶题：23. 合并K个排序链表/数组（归并）https://blog.csdn.net/IOT_victor/article/details/106724729

递归法

# 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 mergeTwoLists(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        if not l1:
            return l2  # 终止条件，直到两个链表都空
        if not l2:
            return l1
        # 判断 l1 和 l2 头结点哪个更小，然后较小结点的 next 指针指向其余结点的合并结果
        if l1.val <= l2.val:  # 递归调用
            l1.next = self.mergeTwoLists(l1.next, l2)
            return l1
        else:
            l2.next = self.mergeTwoLists(l1, l2.next)
            return l2

• 时间复杂度：O(n + m)  ，n 和 m 分别为两个链表的长度
• 空间复杂度：O(n + m)

迭代法（指针不断后移）

# 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 mergeTwoLists(self, l1, l2):
        dummy = ListNode(-1)

        prev = dummy
        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

        # 合并后 l1 和 l2 最多只有一个还未被合并完，我们直接将链表末尾指向未合并完的链表即可
        if l1 is not None:
            prev.next = l1
        else:
            prev.next = l2
        
        return dummy.next

• 时间复杂度：O(n + m)
• 空间复杂度：O(1)

https://leetcode-cn.com/problems/merge-two-sorted-lists/solution/he-bing-liang-ge-you-xu-lian-biao-by-leetcode-solu/