LeetCode 刷题（Python） 之 合并两个有序链表

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

示例：

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

我自己的代码如下：

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def mergeTwoLists(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        
        newList = ListNode(None)
        tail = None
        self.length = 0
        
        if not l1:
            return l2
        if not l2:
            return l1
        
        #print(l1.next.val)
        #print(l2.next.val)
        while l1 and l2:
            node = None
            if (l1.val < l2.val):
                node = ListNode(l1.val)
                l1 = l1.next
            else:
                node = ListNode(l2.val)
                l2 = l2.next
                
            if self.length == 0:
                newList = node
                tail = newList
            else:
                tail.next = node
                tail = node
                '''
                after = newList
                before = newList
                while before:
                    after = before
                    before = before.next
                after.next = node
                '''
            self.length += 1

        if l1: # l1 还剩有数据的话
            print("append L1")
            self.appendList(newList, l1)
            
        if l2: # l2 还剩有数据的话
            print("append L2")
            self.appendList(newList, l2)
        
        if self.length == 0:
            return []
        
        return newList
    
    def appendList(self,rList, tList):
        after = rList
        before = rList
        while before:
            after = before
            before = before.next
        while tList:
            after.next = tList
            after = tList
            tList = tList.next
            self.length += 1
        

对比了一下其中运行效率最高的一个提交代码，我写的。。呵呵，有待提交的地方还有很多