题目:
给你两个 非空 的链表,表示两个非负的整数。它们每位数字都是按照逆序的方式存储的,并且每个节点只能存储一位数字。请你将两个数相加,并以相同形式返回一个表示和的链表。你可以假设除了数字 0 之外,这两个数都不会以 0 开头。
示例:
输入:l1 = [2,4,3], l2 = [5,6,4]
输出:[7,0,8]
解释:342 + 465 = 807.
输入:l1 = [0], l2 = [0]
输出:[0]
输入:l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
输出:[8,9,9,9,0,0,0,1]
python:
方法一:双链表,依次按位相加,取整则为进位的数值,取余同时考虑上一位的进位则为计算的当前节点的数值,同时注意链表均遍历完后需要检查是否有进位值。耗时60ms。
# 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:
k = 0 # 计算已有的节点数目
result = ListNode(val=0, next=None) # 移动中的尾节点
head = result # 头节点
keep = 0 # 进一位时,需要保留的数
while l1 != None or l2 != None:
sum = keep
keep = 0
if l1 != None:
sum += l1.val
l1 = l1.next
if l2 != None:
sum += l2.val
l2 = l2.next
node = ListNode(val=0, next=None)
node.val = sum % 10 # 取余则为当前节点的值
keep += sum // 10 # 取整则为进一位时保留的值
if k == 0: # 如果当前为头节点
head = node
result = node
else:
result.next = node
result = result.next
k += 1
if keep != 0: # 运算结束时最后一位的进位,追加到尾部
node = ListNode(val=0, next=None)
node.val = keep
result.next = node
return head