❤leetcode,python2❤将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_22795513/article/details/80663377

class Solution(object):
    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