题目
给定两个非空链表来表示两个非负整数。位数按照逆序方式存储,它们的每个节点只存储单个数字。将两数相加返回一个新的链表。
你可以假设除了数字 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
"""
head = L = ListNode(0) #头结点,但是链表返回的是第一节点
temp = 0
while l1 or l2 or temp:
if l1:
l1_val = l1.val
else:
l1_val = 0
if l2:
l2_val = l2.val
else:
l2_val = 0
sum = l1_val + l2_val + temp
node = ListNode(sum%10)
temp = sum//10
L.next = node
L = L.next
if l1:
l1 = l1.next
if l2:
l2 = l2.next
return head.next