21. Merge Two Sorted Lists

最新推荐文章于 2024-02-04 15:23:14 发布

Sterben_Da

最新推荐文章于 2024-02-04 15:23:14 发布

阅读量112

点赞数

分类专栏： leetcode-python 文章标签： python 算法 leetcode

本文链接：https://blog.csdn.net/Sterben_Da/article/details/115436292

版权

leetcode-python 专栏收录该内容

99 篇文章 0 订阅

订阅专栏

这是一个关于数据结构和算法的问题，具体是实现一个Python函数，将两个已按非递减顺序排列的链表合并成一个新的有序链表并返回。示例中给出了不同输入情况下的输出，包括空链表和包含0节点的链表。解决方案通过比较两个链表的节点值，依次合并到新的链表中，确保结果仍然有序。

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

21. Merge Two Sorted Lists

Easy

6449754Add to ListShare

Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists.

Example 1:

Input: l1 = [1,2,4], l2 = [1,3,4]
Output: [1,1,2,3,4,4]

Example 2:

Input: l1 = [], l2 = []
Output: []

Example 3:

Input: l1 = [], l2 = [0]
Output: [0]

Constraints:

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

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
        if l1 is None:
            return l2
        if l2 is None:
            return l1

        head_node = cur_node = None
        while l1 and l2:
            node = None
            if l1.val < l2.val:
                node = l1
                l1 = l1.next
            else:
                node = l2
                l2 = l2.next

            if head_node is None:
                head_node = cur_node = node
            else:
                cur_node.next = node
                cur_node = node

        while l1:
            cur_node.next = l1
            cur_node = l1
            l1 = l1.next
        while l2:
            cur_node.next = l2
            cur_node = l2
            l2 = l2.next

        return head_node