21.合并两个有序链表
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]:
#方法一 递归
# if list1 is None:
# return list2
# if list2 is None:
# return list1
# if list1.val < list2.val:
# list1.next = self.mergeTwoLists(list1.next,list2)
# return list1
# else:
# list2.next = self.mergeTwoLists(list1,list2.next)
# return list2
#方法二 暴力法 比较两个指针 放入第三个链表