# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
num = self.toInt(l1)+self.toInt(l2)
num = str(num)[::-1]
lis = None
flag = None
for n in num:
print(n)
l = ListNode(n)
if lis == None:
lis = l
else:
flag.next = l
flag = l
return lis
def toInt(self,l:ListNode)->int:
num = ''
while l.next != None:
num += str(l.val)
l = l.next
num += str(l.val)
return int(num[::-1])
github项目地址:https://github.com/JockWang/LeetCode-Python