DAY-1 链表

题目：

给你两个 非空 的链表，表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的，并且每个节点只能存储 一位 数字。

请你将两个数相加，并以相同形式返回一个表示和的链表。

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution(object):
    node = None

    def get_next(self, node):
        if not node:
            return 0, node
        return node.val, node.next

    def create_list_node(self, values):
        node = None
        for i in reversed(values):
            if not node:
                node = ListNode(i)
            else:
                node = ListNode(i, node)
        return node
    
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        result = []
        add_num = 0
        for i in range(100):
            value_1, l1 = self.get_next(l1)
            value_2, l2 = self.get_next(l2)
            value = value_1 + value_2 + add_num
            if value >= 10:
                value -=10
                add_num = 1
            else:
                add_num = 0
            result.append(value)
            if not l1 and not l2:
                if add_num:
                    result.append(1)       
                node = self.create_list_node(result)
                return node

 

 欢迎CR的各种comments，虚心接受所有意见~