# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution(object):
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
# 迭代法
# 这题其实也不难,将两个链表依次遍历,依次相加,关键是相加可能产生进位,
# 这里加法进位最大也就为1,(最大不过9+9=18,进位为1)。
# 除此之外,两个链表可能不一样长也要考虑到。
head = point = ListNode(0)
carry = 0 # 进位
while l1 or l2:
new_point = ListNode(0)
# 此时l1运算结束,只算l2
if not l1:
sum_ = l2.val + carry
# 各位数为当天节点的值,十位数为进位
new_point.val = sum_ % 10
carry = sum_ // 10
l2 = l2.next
# 此时l2运算结束,只算l1
elif not l2:
sum_ = l1.val + carry
# 各位数为当天节点的值,十位数为进位
new_point.val = sum_ % 10
carry = sum_ // 10
l1 = l1.next
# 此时算l1和l2相加
else:
sum_ = l1.val + l2.val + carry
new_point.val = sum_ % 10
carry = sum_ // 10
l1 = l1.next
l2 = l2.next
point.next = new_point
point = point.next
# 此时l1和l2都加完了,如果进位还有值,那么就在链表最后面加一个节点,节点的值为1
if carry:
new_point = ListNode(1)
point.next = new_point
return head.next
这个递归法,用的不太熟悉。而且在leetcode上运行超出时间限制,递归的时间复杂度为O(2^N)
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution(object):
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
# 递归法
total = l1.val + l2.val
carry = total // 10
new_point = ListNode(total % 10)
if l1 or l2 or carry:
l1 = l1.next if l1.next else ListNode(0)
l2 = l2.next if l2.next else ListNode(0)
l1.val += carry
new_point.next = self.addTwoNumbers(l1,l2)
return new_point