自己的思路:将链表转化为其对应的整数值,相加后将相加结果逆序放入列表,再将列表转化为链表
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
s1,s2="",""
while l1: #s1="243"
s1+=str(l1.val)
l1=l1.next
while l2: #s2="564"
s2+=str(l2.val)
l2=l2.next
num1=int(s1[::-1]) #int(s1)=243, num1=342
num2=int(s2[::-1])
num3=num1+num2 num=807
res=[]
while num3>=10:
res.append(num3%10)
num3=num3//10
res.append(num3) #res=[7,0,8]
head=ListNode(res[0])
tmp=head
i=1
while i<len(res):
tmp.next=ListNode(res[i])
tmp=tmp.next
i=i+1
tmp.next=None
return head