22 leetcode - Merge Two Sorted Lists

最新推荐文章于 2025-12-21 17:04:13 发布

原创最新推荐文章于 2025-12-21 17:04:13 发布 · 187 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #python #合并两个有序数组

算法专栏收录该内容

84 篇文章

订阅专栏

本文介绍了一种使用Python实现的算法，该算法可以将两个已排序的链表合并为一个新的有序链表。通过比较两个链表节点的值并进行拼接操作来完成合并过程。

#!/usr/bin/python
# -*- coding: utf-8 -*-
'''
英文:Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
中文:合并两个有序链表
'''
# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

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
        if l1.val < l2.val:
            start = tmp = l1
            l1 = l1.next
        else:
            start = tmp = l2
            l2 = l2.next
        while l1 and l2:
            if l1.val < l2.val:
                tmp.next = l1
                l1 = l1.next
            else:
                tmp.next = l2
                l2 = l2.next
            tmp = tmp.next
        if l1:
            tmp.next = l1
        if l2:
            tmp.next = l2
        return start

if __name__ == "__main__":
    s = Solution()