Add Two Numbers

问题描述：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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8

思路：这实际上是一个加法问题，每个数用一个对象表示，那么我们需要考虑的问题就是如果一个加法有进位要怎么计算，我们可以加一个参数carry，另外我们的存储结果也需要是一个listnode的实例。这只需要不断迭代就可以了。

代码：

# 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
        """
        carry = 0
        root = n = ListNode(0)
        while l1 or l2 or carry:
            v1 = v2 = 0
            if l1:
                v1 = l1.val
                l1 = l1.next
            if l2:
                v2 = l2.val
                l2 = l2.next
            carry, val = divmod(v1+v2+carry, 10)
            n.next = ListNode(val)
            n = n.next
        return root.next

复杂度：这里只把listnode遍历了一遍，所以时间复杂度是$O(n)$，空间复杂度是$O(n)$