將兩個升序鏈表合并為一個新的 升序 鏈表并回傳，新鏈表是通過拼接給定的兩個鏈表的所有節點組成的，
輸入：l1 = [1,2,4], l2 = [1,3,4] 輸出：[1,1,2,3,4,4]
示例 1：
class Solution:
def mergeTwoLists(self, l1: ListNode, l2: ListNode) -> ListNode:
if l1 is None:
return l2
elif l2 is None:
return l1
elif 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 mergeTwoSorted(self, l1: ListNode,l2:ListNode) ->ListNote:
if l1 is None:
return l2
class Solution:
def mergeTwoLists(self,l1:ListNode,l2:ListNode) -> ListNode:
if l1 is None:
return l2
elif l2 is None:
return l1
elif l1.val < l2.val:
l1.next = self.mergeTwoLists(l1.next, l2)
return l1
else:
l2.next = self.mergeTwoLists(l1,l2.next)
return l2轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/321430.html
標籤：其他