【leetcode刷题】2.两数相加

一.解题思路

这题是链表相加问题，每个数字都是按照逆序存储。首先，定义一个链表用来存储答案，特别主要不要忽略的进位。用一个布尔型的变量flag记录，有进位为1，无进位为0。进位值和两个节点值之和：flag + val1 + val2 小于10，无进位，直接存储至新建链表；若大于10，则有进位。

# 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:
        if l1 is None:
            return l2
        if l2 is None:
            return l1
        carry = ListNode(0)
        res = carry
        flag = 0
        while(l1 or l2 or flag):
            val1 = val2 = 0
            if l1:
                val1 = l1.val
                l1 = l1.next
            if l2:
                val2 = l2.val
                l2 = l2.next
            flag, value = divmod(val1 + val2 +flag, 10)
            res.next = ListNode(value)
            res = res.next
        return carry.next