2.Add Two Numbers
medium
代码还是不够熟练
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.
解法
一种偷懒的做法
先求和,再构建链表
def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
num1=''
num2=''
while l1:
num1+=str(l1.val)
l1=l1.next
while l2:
num2+=str(l2.val)
l2=l2.next
add=str(int(num1[::-1])+int(num2[::-1]))
add=add[::-1]
head=ListNode(add[0])
answer=head
for i in range(1,len(add)):
node=ListNode(add[i])
head.next=node
head=head.next
return answer
效果还不错: