2.两数相加|python|LeetCode

lLeetCode两数相加

参考解答

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        current = ListNode() 
        head = current # 标记头指针

        remainder = 0
		# 遍历l1,l2，就算其中一个到头了，将加数当作0，继续加直到另一个也到头。如果此时还有进位，继续这次循环即可。
        while l1 or l2 or remainder:

            num1 = l1.val if l1 else 0 # 就算l1已经到头了，num1也要取一个数0
            num2 = l2.val if l2 else 0

            total = num1 + num2 + remainder

            current.next = ListNode(total % 10) # 生成结点值
            remainder = total // 10 # 记录进位

            # 更新
            current = current.next
            if l1: l1 = l1.next # 如果l1已经到头了，就不用取下一个结点；做个判断，以免空指针取next出错
            if l2: l2 = l2.next

        return head.next