给出两个 非空 的链表用来表示两个非负的整数。其中,它们各自的位数是按照 逆序 的方式存储的,并且它们的每个节点只能存储 一位 数字。
如果,我们将这两个数相加起来,则会返回一个新的链表来表示它们的和。
您可以假设除了数字 0 之外,这两个数都不会以 0 开头。
示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出:7 -> 0 -> 8
原因:342 + 465 = 807
解法一:我在Leetcode上看到的目前用时最短的
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
add_num = 0
result = None
now_point = None
while l1 is not None or l2 is not None:
if l1 is None:
n1 = 0
else:
n1 = l1.val
l1 = l1.next
if l2 is None:
n2 = 0
else:
n2 = l2.val
l2 = l2.next
num = n1 + n2 + add_num
if num/10 == 1:
point = ListNode(num%10)
add_num = 1
else:
point = ListNode(num)
add_num = 0
if result is None:
result = point
now_point = point
else:
now_point.next = point
now_point = point
if add_num <> 0:
point = ListNode(1)
now_point.next = point
return result