LeetCode_2_add-two-numbers

 def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        out_list = None
        temp_node = None

        next_add = 0
        while l1 and l2:
            value = l1.val + l2.val + next_add
            l1 = l1.next
            l2 = l2.next

            if value >=10:
                value_real = value % 10
                next_add = int(value/10)
            else:
                next_add = 0
                value_real = value

            if out_list == None:
                out_list = ListNode(value_real)
                temp_node = out_list
            else:
                new_node = ListNode(value_real)
                temp_node.next = new_node
                temp_node = new_node

        while l1:
            value = l1.val  + next_add
            l1 = l1.next
            if value >= 10:
                value_real = value % 10
                next_add = int(value / 10)
            else:
                next_add = 0
                value_real = value

            if out_list == None:
                out_list = ListNode(value_real)
                temp_node = out_list
            else:
                new_node = ListNode(value_real)
                temp_node.next = new_node
                temp_node = new_node

        while l2:
            value = l2.val  + next_add
            l2 = l2.next
            if value >= 10:
                value_real = value % 10
                next_add = int(value / 10)
            else:
                next_add = 0
                value_real = value

            if out_list == None:
                out_list = ListNode(value_real)
                temp_node = out_list
            else:
                new_node = ListNode(value_real)
                temp_node.next = new_node
                temp_node = new_node

        if next_add > 0:
            new_node = ListNode(next_add)
            temp_node.next = new_node
            temp_node = new_node


        return out_list


if __name__ == '__main__':
    l1 = init_Node_from_list([5])
    l2 = init_Node_from_list([5])
    so = Solution()
    l3 = so.addTwoNumbers(l1,l2)
    print(l3)

两个链接相加,考虑链表不同长度和进位问题

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值