将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例 1:
输入:l1 = [1,2,4], l2 = [1,3,4] 输出:[1,1,2,3,4,4]
示例 2:
输入:l1 = [], l2 = [] 输出:[]
示例 3:
输入:l1 = [], l2 = [0] 输出:[0]
解法1:
思路:建立一个空的链表,通过传值的形式,把小的值传入到新链表里。
class Solution(object):
def mergeTwoLists(self,l1,l2):
merge = ListNode()
merge1 = merge
curr1 = l1
curr2 = l2
while curr1 != None and curr2 != None:
if curr1.val <= curr2.val:
merge1.next = curr1
curr1 = curr1.next
else:
merge1.next = curr2
curr2 = curr2.next
merge1 = merge1.next
if curr1 != None:
merge1.next = curr1
else:
merge1.next = curr2
return merge.next
解法2:递归
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
if l1== None:
return l2
if l2 == None:
return l1
if l1.val < l2.val:
l1.next = self.mergeTwoLists(l1.next,l2)
return l1
else:
l2.next = self.mergeTwoLists(l1,l2.next)
return l2