Add Two Numbers
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.
Solution
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
if not l1:
return l2
if not l2:
return l1
ret = ListNode(0)
l = ret
count = 0
while l1 or l2:
if l1 and l2:
s = l1.val+l2.val+count
count = int(s/10)
l.next = ListNode(int(s%10))
l = l.next
l1 = l1.next
l2 = l2.next
elif not l1:
s = l2.val + count
count = int(s/10)
l.next = ListNode(int(s%10))
l = l.next
l2 = l2.next
elif not l2:
s = l1.val +count
count = int(s/10)
l.next = ListNode(int(s%10))
l = l.next
l1 = l1.next
if count != 0 :
l.next = ListNode(count)
return ret.next