LeetCode-21. Merge Two Sorted Lists

最新推荐文章于 2022-02-11 00:03:48 发布

零件儿

最新推荐文章于 2022-02-11 00:03:48 发布

阅读量158

点赞数

CC 4.0 BY-SA版权

分类专栏： python

本文链接：https://blog.youkuaiyun.com/weixin_40744915/article/details/79676275

python 专栏收录该内容

25 篇文章

订阅专栏

本文介绍了一种将两个已排序的链表合并为一个新排序链表的方法。提供了两种实现方式：迭代法和递归法，并附带了详细的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.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

solution from discuss：

这是一个链表问题，有迭代和递归方法：

# iteratively
def mergeTwoLists1(self, l1, l2):
dummy = cur = ListNode(0)#注意是（）而不是[]
while l1 and l2:
if l1.val < l2.val:
cur.next = l1
l1 = l1.next
else:
cur.next = l2
l2 = l2.next
cur = cur.next
cur.next = l1 or l2    #.next
return dummy.next

# recursively
def mergeTwoLists2(self, l1, l2):
if not l1 or not l2:
return l1 or l2
if l1.val < l2.val:
l1.next = self.mergeTwoLists(l1.next, l2)
return l1
else:
l2.next = self.mergeTwoLists(l1, l2.next)
return l2

# in-place, iteratively
def mergeTwoLists(self, l1, l2):
if None in (l1, l2):
return l1 or l2
dummy = cur = ListNode(0)
dummy.next = l1
while l1 and l2:
if l1.val < l2.val:
l1 = l1.next
else:
nxt = cur.next
cur.next = l2
tmp = l2.next
l2.next = nxt
l2 = tmp
cur = cur.next
cur.next = l1 or l2
return dummy.next
'''