基础算法（Leetcode）刻意练习训练营：第十天打卡

今天的题目是2. 两数相加

第一种循环：

class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        r = re = ListNode(0)
        carry = 0
        while(l1 or l2):
            x = l1.val if l1 else 0
            y = l2.val if l2 else 0
            s = carry + x + y
            carry = s // 10
            r.next = ListNode(s % 10)
            r = r.next
            if(l1 != None):
                l1 = l1.next
            if(l2 != None):
                l2 = l2.next
        if(carry > 0):
            r.next = ListNode(1)
        return re.next

Your runtime beats 16.54 % of python3 submissions
Your memory usage beats 8.73 % of python3 submissions (13.6 MB)

第二种方式递归：

        def add(a, b, carry):
            if not (a or b):
                return ListNode(1) if carry else None
            a = a if a else ListNode(0)
            b = b if b else ListNode(0)
            val = a.val + b.val + carry
            a.val = val % 10
            carry = val // 10
            a.next = add(a.next, b.next, carry)
            return a
        return add(l1, l2, 0) 

1563/1563 cases passed (68 ms)
Your runtime beats 82.6 % of python3 submissions
Your memory usage beats 8.76 % of python3 submissions (13.4 MB)