Leetcode 2 第一次做 Python

# Definition for singly-linked list.# class ListNode(object):#     def __init__(self, x):#         self.val = x#         self.next = Noneclass Solution(object):    def addTwoNumbers(self,l1, l2):        Levup = 0        new_l = ListNode(0)        k = new_l        while l1 or l2:            new_l.val = (Levup +l1.val+l2.val)%10            Levup = (l1.val + l2.val+Levup)/10            if(l1.next and not l2.next):                l1 = l1.next                l2 = ListNode(0)            elif(l2.next and not l1.next):                l2 = l2.next                l1 = ListNode(0)            elif(not(l1.next or l2.next)):                if Levup==0:                    l1 = None                    l2 = None                else:                    new_r = ListNode(Levup)                    new_l.next = new_r                    break            else:                l1 = l1.next                l2 = l2.next            if(l1 or l2):                new_r = ListNode(0)                new_l.next = new_r                new_l = new_l.next        new_l = None        return k

Python的第二题，做的非常乱效率极低，而且修正了很多次。以后改正，先去学习一下大佬们的代码