21. Merge Two Sorted Lists. Sol

isee_nh

于 2022-02-05 17:10:01 发布

阅读量55

点赞数

分类专栏： Leetcode题解 PAT甲级题解文章标签： gnu list leetcode

本文链接：https://blog.csdn.net/isee_nh/article/details/122791604

版权

Leetcode题解同时被 2 个专栏收录

44 篇文章 0 订阅

订阅专栏

PAT甲级题解

1 篇文章 0 订阅

订阅专栏

这篇博客记录了如何使用Python解决LeetCode中的一个问题——合并两个有序链表。作者通过创建一个虚拟头节点prehead，然后比较两个链表的节点值，依次连接最小值的节点，最终形成一个新的有序链表。这个方法确保了合并过程的稳定性且时间复杂度为O(n)。博客适合对链表操作和算法感兴趣的读者学习。

摘要由CSDN通过智能技术生成

LeetCode官方教程参考答案，穷学生只充了一个月的会员，记录下来备忘

You are given the heads of two sorted linked lists list1 and list2.

Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists.

Return the head of the merged linked list.

Example 1:

Input: list1 = [1,2,4], list2 = [1,3,4]
Output: [1,1,2,3,4,4]

Example 2:

Input: list1 = [], list2 = []
Output: []

Example 3:

Input: list1 = [], list2 = [0]
Output: [0]

Constraints:

The number of nodes in both lists is in the range [0, 50].
-100 <= Node.val <= 100
Both list1 and list2 are sorted in non-decreasing order.

class Solution:
    def mergeTwoLists(self, l1, l2):
        # maintain an unchanging reference to node ahead of the return node.
        prehead = ListNode(-1)

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

        # At least one of l1 and l2 can still have nodes at this point, so connect
        # the non-null list to the end of the merged list.
        prev.next = l1 if l1 is not None else l2

        return prehead.next