版权声明:https://blog.csdn.net/CAIYUNFREEDOM https://blog.csdn.net/CAIYUNFREEDOM/article/details/91383946
2. Add Two Numbers
Medium
52601354FavoriteShare
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.
class Solution(object):
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
carry = 0
s = 0
#l1 = l1.next
#l2 = l2.next
res =ListNode(0)
r = res
while True:
if (l1 is None) and (l2 is None):
break
if l1 is None:
a = 0
else:
a = l1.val
l1 = l1.next
if l2 is None:
b = 0
else:
b = l2.val
l2 = l2.next
#print 'dd'
s = a+b+carry
#print s,'= ',a,'+',b,'+',carry
res.next = ListNode(s%10)
res = res.next
carry = s/10
#print 'c',carry
#print 'c',carry
if carry>0:
res.next = ListNode(carry)
return r.next