题目描述:
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入: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 not l1:
return l2
if not l2:
return l1
head=ListNode(0)
cur=head
while l1 and l2:
if l1.val>=l2.val:
cur.next=l2
l2=l2.next
else:
cur.next=l1
l1=l1.next
cur=cur.next
if not l1:
cur.next=l2
else:
cur.next=l1
return head.next
方法二:递归法
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
if not l1:
return l2
if not l2:
return l1
if l1.val<=l2.val:
head=l1
head.next=self.mergeTwoLists(l1.next,l2)
else:
head=l2
head.next=self.mergeTwoLists(l1,l2.next)
return head