| 两数相加
给你两个 非空 的链表,表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的,并且每个节点只能存储 一位 数字。
请你将两个数相加,并以相同形式返回一个表示和的链表。
你可以假设除了数字 0 之外,这两个数都不会以 0 开头。
输入: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]
|题解
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
"""
解题思路:
1.引入虚拟头节点,可以统一解决链表为空问题
2.循环遍历两个链表, 直到有一个结束
3.单独遍历比较长的链表
4.返回新的链表
"""
def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
# 引入虚拟头节点
new_head1, new_head2 = ListNode(val='x'), ListNode(val='x')
new_head1.next, new_head2.next = l1, l2
new_l1, new_l2 = new_head1, new_head2
new_head, tail, carry_flag = None, None, 0 # carry_flag 表示需要进位的值, new_head 新的链表的头指针, tail节点始终指向新链表的尾节点
while new_l1.next is not None and new_l2.next is not None:
sum_val = new_l1.next.val + new_l2.next.val + carry_flag
node, carry_flag = self.get_new_node(sum_val)
if new_head is None: # 当新链表为空时,头指针和尾指针同时指向当前节点
new_head, tail = node,node
else:
tail.next, tail = node, node # 只需移动尾节点
new_l1 = new_l1.next
new_l2 = new_l2.next
while new_l1.next is not None: # 如果new_l1的长度大于new_l2
sum_val = new_l1.next.val + carry_flag
node, carry_flag = self.get_new_node(sum_val)
tail.next, tail = node, node
new_l1 = new_l1.next
while new_l2.next is not None: # 如果new_l2的长度大于new_l1
sum_val = new_l2.next.val + carry_flag
node, carry_flag = self.get_new_node(sum_val)
tail.next, tail = node, node
new_l2 = new_l2.next
if carry_flag > 0: # 如果最后一位需要进位 如 999 + 1
node = ListNode(carry_flag)
tail.next, tail = node, node
return new_head
def get_new_node(self, sum_val):
curret_val = sum_val % 10
carry_flag = sum_val // 10
node = ListNode(curret_val)
return node, carry_flag