给你两个 非空 的链表,表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的,并且每个节点只能存储 一位 数字。
请你将两个数相加,并以相同形式返回一个表示和的链表。
你可以假设除了数字 0 之外,这两个数都不会以 0 开头。
示例 1:
输入:l1 = [2,4,3], l2 = [5,6,4]
输出:[7,0,8]
解释:342 + 465 = 807.
示例 2:
输入:l1 = [0], l2 = [0]
输出:[0]
示例 3:
输入:l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
输出:[8,9,9,9,0,0,0,1]
提示:
每个链表中的节点数在范围 [1, 100] 内
0 <= Node.val <= 9
题目数据保证列表表示的数字不含前导零
from typing import Optional
class ListNode:
def __init__(self, val=0, next=None):
self.val = val
self.next = next
class Solution:
def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]:
result = ListNode()
jinwei = 0
current = result
while l1 or l2 or jinwei:
if not l1.next:
l1.next = ListNode()
if not l2.next:
l2.next = ListNode()
tmp = l1.val + l2.val + jinwei
jinwei = tmp // 10
current.next = ListNode(tmp % 10)
l1 = l1.next
l2 = l2.next
current = current.next
if l1.next == None and l2.next == None and l1.val == 0 and l2.val == 0 and jinwei == 0:
break
return result.next
l1 = [8, 3, 2]
l2 = [9, 2, 1]
l1 = ListNode(8, ListNode(3, ListNode(2)))
l2 = ListNode(9, ListNode(2, ListNode(1)))
s = Solution()
x = s.addTwoNumbers(l1, l2)
while x:
print(x.val)
x = x.next