0002. 两数相加

[utterances-bot]

0002. 两数相加 | 算法通关手册

2. 两数相加 # 标签：递归、链表、数学 难度：中等 题目大意 # 描述：给定两个非空的链表 l1 和 l2。分别用来表示两个非负整数，每位数字都是按照逆序的方式

https://algo.itcharge.cn/Solutions/0001-0099/add-two-numbers/

[jianghongcheng]

    dummy = ListNode(0)
    cur = dummy
    carry = 0
    while l1 != None or l2 != None:
        if l1 == None:
            l1, l2 = l2, l1
        if l2 != None:
            carry, l1.val = divmod((l1.val + l2.val + carry), 10)
            cur.next = l1
            l1, l2, cur = l1.next, l2.next, cur.next
        else:
            carry, l1.val = divmod((l1.val + carry), 10)
            cur.next = l1
            l1,  cur = l1.next, cur.next        
    if carry == 1:
        cur.next = ListNode(carry)

    return dummy.next

[euuen]

这好像是递推了，而不是递归