leetcode-0002

# 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
        """
        c = 0
        dummy = cur = ListNode(0)
        while l1 or l2 or c:
            num1 = l1.val if l1 else 0
            num2 = l2.val if l2 else 0
            (c, val) = divmod(num1 + num2 + c, 10)
            cur.next = ListNode(val)
            l1 = l1.next if l1 else None
            l2 = l2.next if l2 else None
            cur = cur.next
        return dummy.next