将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-two-sorted-lists
leetcode官方解答搬运:
递归:递归边界:l1或l2中有一个为None。重复做的事:找出l1,l2中小的那个,用小的那个.next跟大的继续进入递归。递归返回的返回值为链表的节点。递归出来时,大的节点一层一层接到之前找出的小的那个节点上然后返回。
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
if not l1 or not l2:
return l1 if l1 else 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
归并排序的并:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
#归并排序的并
cur = dummy = ListNode(0)
while(l1 and l2):
if l1.val>=l2.val:
dummy.next = l2
l2 = l2.next
else:
dummy.next = l1
l1 = l1.next
dummy = dummy.next
dummy.next =l1 if l1 else l2
return cur.next