给出两个 非空 的链表用来表示两个非负的整数。其中,它们各自的位数是按照 逆序 的方式存储的,并且它们的每个节点只能存储 一位 数字。
如果,我们将这两个数相加起来,则会返回一个新的链表来表示它们的和。
您可以假设除了数字 0 之外,这两个数都不会以 0 开头。
示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出:7 -> 0 -> 8
原因:342 + 465 = 807
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
# add = 0
# res = ListNode(0)
# res_copy = res
# while l1 and l2:
# val = l1.val+l2.val+add
# add = 1 if val>9 else 0
# res.next = ListNode(val%10)
# res = res.next
# l1,l2 = l1.next,l2.next
# while l1:
# val = l1.val+add
# add = 1 if val>9 else 0
# res.next = ListNode(val%10)
# res = res.next
# l1=l1.next
# while l2:
# val = l2.val+add
# add = 1 if val>9 else 0
# res.next = ListNode(val%10)
# res = res.next
# l2=l2.next
# if add:
# res.next = ListNode(add)
# res = res.next
# return res_copy.next
res = res_copy = ListNode(0)
add = 0
while l1 or l2 or add:
val = add
if l1: l1,val = l1.next,val+l1.val
if l2: l2,val = l2.next,val+l2.val
add,val = divmod(val,10)
res.next = ListNode(val)
res = res.next
return res_copy.next