python leetcode 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 ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution(object):
    def mergeTwoLists(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        if not l1:
            return l2
        if not l2:
            return l1
        mergeHead = ListNode(0)
        tmp = mergeHead
        while l1 and l2:
            if l1.val < l2.val:
                mergeHead.next = l1
                l1 = l1.next
            else:
                mergeHead.next = l2
                l2 = l2.next
            mergeHead = mergeHead.next
        if l1:
            mergeHead.next = l1
        if l2:
            mergeHead.next = l2
        return tmp.next