题目
我的代码(打败了99.6%)
简单来说就是先将list转化为int,然后计算,然后再转换为int。
# 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:
val1=0
while l1:
val1*=10
val1+=l1.val
l1=l1.next
val2=0
while l2:
val2*=10
val2+=l2.val
l2=l2.next
val3=val1+val2
if val3==0:
return ListNode(0)
tail=None
while val3>0:
new=ListNode(val3%10)
new.next=tail
tail=new
val3=val3//10
return new