leecoda第二题

# 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
        """


        quotient = 0
        ll3=l3=ListNode(0)
        while l1 or l2 or quotient:
            val1=val2 = 0
            if l1:
                val1 = l1.val
                l1 = l1.next
            if l2:
                val2 = l2.val
                l2 = l2.next
            quotient,remainder=divmod(val1+val2+quotient,10)
            l3.next= ListNode(remainder)
            l3=l3.next
        return ll3.next