[leetcode] Add Two Numbers

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)

Output: 7 -> 0 -> 8

思路:思路很简单,类似add binary, 逐位比较,过十进位

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

class Solution:
    # @return a ListNode
    def addTwoNumbers(self, l1, l2):
        newhead = ListNode(0)
        head1 = l1
        head2 = l2
        node = newhead
        carry = 0
        while head1 != None or head2 != None:
            val1 = head1.val if head1 != None else 0
            val2 = head2.val if head2 != None else 0
            val = val1 + val2 + carry
            node.next = ListNode(val % 10)
            carry = val / 10
            node = node.next
            head1 = head1.next if head1 != None else head1
            head2 = head2.next if head2 != None else head2
        if carry == 0:
            node.next = None
        else:
            node.next = ListNode(1)
            node.next.next =None
        return newhead.next
        
        


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值