目录
一、题目
二、题解
三、源码
# 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):
if not l1:
return l2
if not l2:
return l1
s1, s2 = '', ''
while l1:
s1 += str(l1.val)
l1 = l1.next
while l2:
s2 += str(l2.val)
l2 = l2.next
s = str(int(s1[::-1]) + int(s2[::-1]))[::-1]
l3 = ListNode(int(s[0]))
l = l3
for i in s[1:]:
l3.next = ListNode(int(i))
l3 = l3.next
return l