给定两个非空链表来表示两个非负整数。位数按照逆序方式存储,它们的每个节点只存储单个数字。将两数相加返回一个新的链表。
你可以假设除了数字 0 之外,这两个数字都不会以零开头。
示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4) 输出:7 -> 0 -> 8 原因:342 + 465 = 807
索引方式有点像归并排序两个有序数组合并的索引方式
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def addTwoNumbers(self, l1, l2):
"""
注意长度不一样的变化
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
if l1 == None:
return l2
if l2 == None:
return l1
result_node = ListNode((l1.val + l2.val) % 10)
temp = (l1.val + l2.val) // 10
temp_node = result_node
while not l1.next == None and not l2.next == None:
l1 = l1.next
l2 = l2.next
sum = l1.val + l2.val + temp
result_node.next = ListNode(sum % 10)
result_node = result_node.next
temp = sum // 10
while not l1.next == None:
l1 = l1.next
sum = l1.val + temp
result_node.next = ListNode(sum % 10)
result_node = result_node.next
temp = sum // 10
while not l2.next == None:
l2 = l2.next
sum = l2.val + temp
result_node.next = ListNode(sum % 10)
result_node = result_node.next
temp = sum // 10
if not temp == 0:
result_node.next = ListNode(temp)
return temp_node