合并两个有序链表

1，leetcodecn上合并两个有序链表：将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 

示例：

输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

def mergeTwoLists(l1, l2):
        head = None
        node = head
        while l1 != None and l2 != None:
            if l1.val < l2.val:
                if head == None:
                    head = l1
                    node = head
                else:
                    node.next = l1
                    node = node.next
                l1 = l1.next
            else:
                if head == None:
                    head = l2
                    node = head
                else:
                    node.next = l2
                    node = node.next
                l2 = l2.next
            
        if l1 != None:
            if head == None:
                head = l1
            else:
                node.next = l1
            
        if l2 != None:
            if head == None:
                head = l2
            else:
                node.next = l2
        
        return head

上面自己自己写的代码，申明了两个 ListNode， 下面贴出官方的代码，瞬间觉的我要吐血，我的代码冗余。

 def mergeTwoLists(self, l1, l2):
        prehead = ListNode(-1)
        prev = prehead
        while l1 and l2:
            if l1.val <= l2.val:
                prev.next = l1
                l1 = l1.next
            else:
                prev.next = l2
                l2 = l2.next            
            prev = prev.next

        prev.next = l1 if l1 is not None else l2

        return prehead.next

一句代码的误差，引发的血案。谨记。。。。