https://leetcode-cn.com/problems/add-two-numbers/

這里的兩個數(shù)已經翻轉了，所以不需要進行反轉直接相加即可
需要注意的是進位，在最后的時候如果l1, l2都沒有數(shù)據，但是addition進位為1，還需要在最后加一個值為1的node

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        head = tail = None
        addition = 0
        while (l1 or l2 or addition):
            v1 = l1.val if l1 else 0
            v2 = l2.val if l2 else 0
            s = v1 + v2 + addition
            value = s % 10
            addition = 1 if s > 9 else 0
            if not head:
                tail = head = ListNode(value)
            else:
                tmp = ListNode(value)
                tail.next = tmp
                tail = tail.next
            l1 = l1.next if l1 else None
            l2 = l2.next if l2 else None
        return head