You are given two linked lists representing two non-negative numbers. 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.
Example
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Solution
(Add-Two-Numbers.py) download 1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
# 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
"""
addon = 0
ret = ListNode ( - 1 )
node = ret
while l1 or l2 :
newval = 0
if l1 and l2 :
newval = l1 . val + l2 . val + addon
elif l1 :
newval = l1 . val + addon
else :
newval = l2 . val + addon
newNode = ListNode ( newval % 10 )
node . next = newNode
node = newNode
addon = newval / 10
if l1 :
l1 = l1 . next
if l2 :
l2 = l2 . next
if addon == 1 :
node . next = ListNode ( 1 )
return ret . next