链表：两数相加

class ListNode(object):
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next


class List:
    def init_list(self, data):
        # 判断是否为空
        if len(data) == 0:
            return None
        else:
            # 头结点
            head = ListNode(data[0])
            # 尾节点
            tail = head
            # 逐个为 data 内的数据创建结点, 建立链表
            for i in data[1:]:
                node = ListNode(i)
                tail.next = node
                tail = node
            return head


class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        res = ListNode(0)  # 定义一个首节点
        p = res  # 用来往后链接后面加进来的节点
        carry = 0  # 是否进位
        while l1 or l2 or carry:
            t1 = l1.val if l1 else 0  # 当前的l1有值的话就取出来，没有值的话就赋值为0
            t2 = l2.val if l2 else 0  # 当前的l2有值的话就取出来，没有值的话就赋值为0
            carry, b = divmod((t1 + t2 + carry), 10)  # 得到每一次的商和余数，商就是carry，余数就是加起来得到的值
            p.next = ListNode(b)
            p = p.next
            l1 = l1.next if l1 else l1
            l2 = l2.next if l2 else l2
        return res.next


a = [2, 4, 3]
l1 = List().init_list(a)
b = [5, 6, 4]
l2 = List().init_list(b)
aa = Solution().addTwoNumbers(l1, l2)
print(aa.val)
print(aa.next.val)
print(aa.next.next.val)

结果

7
0
8