leetcode 【 Merge Two Sorted Lists 】 python 实现

最新推荐文章于 2025-08-20 15:37:55 发布

weixin_33712881

最新推荐文章于 2025-08-20 15:37:55 发布

阅读量56

点赞数

CC 4.0 BY-SA版权

文章标签： python 数据结构与算法 runtime

原文链接：http://www.cnblogs.com/xbf9xbf/p/4186905.html

本文介绍了如何使用Python合并两个已排序的链表，并通过实例展示了实现过程。代码示例中定义了链表节点类，并实现了合并函数。合并过程中采用虚拟头结点和双指针技巧，确保了链表的有效整合。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

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.

代码：oj在线测试通过 Runtime: 208 ms

 1 # Definition for singly-linked list.
 2 # class ListNode:
 3 #     def __init__(self, x):
 4 #         self.val = x
 5 #         self.next = None
 6 
 7 class Solution:
 8     # @param two ListNodes
 9     # @return a ListNode
10     def mergeTwoLists(self, l1, l2):
11         if l1 is None:
12             return l2
13         if l2 is None:
14             return l1
15         
16         dummyhead = ListNode(0)
17         dummyhead.next = None
18         p = dummyhead
19         while l1 is not None and l2 is not None:
20             if l1.val > l2.val:
21                 p.next = l2
22                 l2 = l2.next
23             else:
24                 p.next = l1
25                 l1 = l1.next
26             p = p.next
27         if l1 is not None:
28             p.next = l1
29         else:
30             p.next = l2
31         return dummyhead.next