题目描述如下
代码如下
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
a=''
a1=l1
while a1!=None:
a=a+str(a1.val)
a1=a1.next
a=list(a)
a.reverse()
a=''.join(a)
b1=l2
b=''
while b1!=None:
b=b+str(b1.val)
b1=b1.next
b=list(b)
b.reverse()
b=''.join(b)
c=int(a)+int(b)
a3=ListNode(1)
c=list(str(c))
print(c)
for i in range(len(c)):
c[i]=int(c[i])
if i==0:
a3=ListNode(c[i])
else:
tmp=ListNode(c[i],a3)
a3=tmp
return a3