将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/merge-two-sorted-lists
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解法一:利用递归
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
if l1 is None:
return l2
if l2 is 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
解法二:迭代
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
head = ListNode(None)
c = head
while l1 and l2:
if l1.val < l2.val
c.next = l1
l1 = l1.next
else:
c.next = l2
l2 = l2.next
c = c.next
if l1:
c.next = l1
else:
c.next = l2
return head.next