21. Merge Two Sorted Lists（python3）

21. Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

解答：

class Solution:
    def mergeTwoLists(self, l1, l2):
        """
        :type l1:ListNode
        :type l2:ListNode
        :rtype ListNode
        """
        if not l1:
            return l2
        if not l2:
            return l1
        if l1.val <= l2.val:
            mergeHead=l1
            mergeHead.next=self.mergeTwoLists(l1.next, l2)
        else:
            mergeHead=l2
            mergeHead.next=self.mergeTwoLists( l1, l2.next)    
        return mergeHead