# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def mergeTwoLists(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
if l1==None and l2==None:
return None
if l1==None:
return l2
if l2==None:
return l1
if l1.val<l2.val:
l1.next=self.mergeTwoLists(l1.next,l2)
return l1
if l2.val<l1.val:
l2.next=self.mergeTwoLists(l1,l2.next)
return l2
elif l1.val==l2.val:
l1.next=self.mergeTwoLists(l1.next,l2)
return l1
python版Leetcode21. 合并两个有序链表
最新推荐文章于 2024-02-07 14:30:00 发布