Description
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.
Solution
简单的模拟一下就好了。
Code
class Solution(object):
def addTwoNumbers(self, l1, l2):
a=0
tmp=l1
ten=1
while tmp!=None:
a=a+tmp.val*ten
ten=ten*10
tmp=tmp.next
tmp=l2
ten=1
while tmp!=None:
a=a+tmp.val*ten
ten=ten*10
tmp=tmp.next
l3=ListNode(a%10)
tail=l3
a=a/10
while a:
tail.next=ListNode(a%10)
tail=tail.next
a=a/10
return l3