python---链表加和(倒序)

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



class Solution:
    """
    @param: l1: the first list
    @param: l2: the second list
    @return: the sum list of l1 and l2 
    """
    def addLists(self, l1, l2):
        # write your code here
        flag = 0
        fun = lambda x, y: x+y
        head = tem = ListNode(-1)
        while l1 or l2:
            if l1 and l2:
                val = fun(l1.val, l2.val)
                l1 = l1.next
                l2 = l2.next
            elif l1:
                val = l1.val
                l1 = l1.next
            else:
                val = l2.val
                l2 = l2.next

            if val + flag < 10:
                tem.next = ListNode(val + flag)
                flag_next = 0
            else:
                tem.next = ListNode(val + flag - 10)
                flag_next = 1
            flag = flag_next
            tem = tem.next
        if flag==1:
            tem.next = ListNode(1)   

        return head.next
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值