leetcode 第二道编程题
题目 leetcode_problem2
给定两个非空链表来表示两个非负整数。位数按照逆序方式存储,它们的每个节点只存储单个数字。将两数相加返回一个新的链表。
你可以假设除了数字 0 之外,这两个数字都不会以零开头。
示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出:7 -> 0 -> 8
原因:342 + 465 = 807
看到这道题,我们一般会想到,先将链表转换成整数,然后做相加计算,最后再转换成链表形式。
代码示例1:
class Solution:
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
_l1 = _l2 = ''
while l1:
_l1 += str(l1.val)
l1 = l1.next
while l2:
_l2 += str(l2.val)
l2 = l2.next
res = str(int(_l1[::-1])+int(_l2[::-1]))[::-1]
dummy = ListNode(0)
temp = dummy
for i in res:
node = ListNode(i)
temp.next = node
temp = temp.next
return dummy.next
这种方法很巧妙,直接利用str()将每个节点的值转换成字符并串起来成字符串,通过过int()在将其转换成对应的多位数来计算。
需要注意的是,链表为 ListNode格式类型。其中self.val表示当前节点对应的值; self.next表示指向下一节点的指针。
python中,a[::-1]表示将对应的list或元组倒序。
这道题的解法肯定还有很多。下面贴出几种觉得不错的代码以供参考:
Python supports arbitrarily large integers, so I can safely turn the two lists into ints, add them, and turn the sum into a list. (采用递归的方式)
class Solution:
def addTwoNumbers(self, l1, l2):
def toint(node):
return node.val + 10 * toint(node.next) if node else 0
def tolist(n):
node = ListNode(n % 10)
if n > 9:
node.next = tolist(n / 10)
return node
return tolist(toint(l1) + toint(l2))
Iterative tolist instead of recursive:
class Solution:
def addTwoNumbers(self, l1, l2):
def toint(node):
return node.val + 10 * toint(node.next) if node else 0
n = toint(l1) + toint(l2)
first = last = ListNode(n % 10)
while n > 9:
n /= 10
last.next = last = ListNode(n % 10)
return first
And a very different solution that could sum arbitrarily many addends, not just two:(直接对链表的值进行求和运算)
class Solution:
def addTwoNumbers(self, l1, l2):
addends = l1, l2
dummy = end = ListNode(0)
carry = 0
while addends or carry:
carry += sum(a.val for a in addends)
addends = [a.next for a in addends if a.next]
end.next = end = ListNode(carry % 10)
carry /= 10 #求取进位
return dummy.next