# 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
"""
l3=ListNode(0)
cur=l3
carry=0
while(l1 or l2):
sum=0
if(l1):
sum = l1.val
l1 = l1.next
if(l2):
sum += l2.val
l2 = l2.next
sum+=carry
cur.next=ListNode(sum%10)
carry=0
if(sum>=10):
carry=1
cur=cur.next
if(carry>0):
cur.next=ListNode(1)
return l3.next
# 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
"""
l3=ListNode(0)
cur=l3
carry=0
while(l1 or l2):
sum=0
if(l1):
sum = l1.val
l1 = l1.next
if(l2):
sum += l2.val
l2 = l2.next
sum+=carry
cur.next=ListNode(sum%10)
carry=0
if(sum>=10):
carry=1
cur=cur.next
if(carry>0):
cur.next=ListNode(1)
return l3.next