2_两数相加

给你两个 非空 的链表，表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的，并且每个节点只能存储 一位 数字。
请你将两个数相加，并以相同形式返回一个表示和的链表。
你可以假设除了数字 0 之外，这两个数都不会以 0 开头。

示例 1：
输入：l1 = [2,4,3], l2 = [5,6,4]
输出：[7,0,8]
解释：342 + 465 = 807.

解法一：

# 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:

        carry = 0   # 初始化一个进位，定义为carry位
        res = n = ListNode(0)    
        while l1 or l2 or carry:
            if l1:
                carry += l1.val  # 开始相加
                l1 = l1.next    # 更新l1
            if l2:
                carry += l2.val
                l2 = l2.next
            
            carry , val = divmod(carry,10)   # carry位与10进行divmod运算，得到商和余数，更新carry位与val值
            #  python divmod() 函数把除数和余数运算结果结合起来，返回一个包含商和余数的元组(a // b, a % b)。
            n.next = n = ListNode(val)      # 更新链表
        
        return res.next
                

解法二：

# 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:
        dummyHead= ListNode(-1)
        d=dummyHead
        carry=0
        while l1 or l2 :
            x= l1.val if l1 else 0
            y= l2.val if l2 else 0
            sum=carry+x+y
            carry=sum//10  #整数除法
            d.next=ListNode(sum%10)
            d=d.next
            if l1!=None :
                l1=l1.next
            if l2!=None :
                l2=l2.next
        if carry>0 :
            d.next=ListNode(1)
        return dummyHead.next

解法三：

# 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 == None:
            return l2
        if l2 == None:
            return l1

        dummy = ListNode(0)
        p = dummy
        carry = 0
    
        while l1 and l2:
            p.next = ListNode((l1.val + l2.val + carry) % 10 )
            carry  = (l1.val + l2.val + carry) // 10
            l1 = l1.next
            l2 = l2.next
            p = p.next
        
        if l2: 
            while l2:
                p.next = ListNode((l2.val +carry) % 10)
                carry = (l2.val + carry) // 10
                l2 = l2.next
                p = p.next

        if l1:
            while l1:
                p.next = ListNode((l1.val + carry) % 10)
                carry = (l1.val + carry) // 10 
                l1 = l1.next
                p = p.next

        if carry == 1:
            p.next = ListNode(1)
        return dummy.next

解法四：
解题思路：
1.取出两个链表的数值
2.两个链表的值相加求和
3.创建新链表
省去了进位的设置

class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:

        s1 = ''
        s2 = ''    # 初始化两个空字符串用来保存每个链表的值
        while l1 is not None:
            s1 = s1 + str(l1.val)
            l1 = l1.next
        
        while l2 is not None:
            s2 = s2 + str(l2.val)
            l2 = l2.next
        
        s3 = int(s1[::-1]) + int(s2[::-1])    # 将两个字符串倒序转为int型进行相加，并赋给s3
        s3 = [int (i) for i in str(s3)]   # 将s3转换为list类型
        
        root = ListNode(s3.pop())     # 创建新链表，root作为根节点，搭配列表的pop方法
        current = root     # current用于创建接下来的节点

        while s3 != []:
            current.next = ListNode(s3.pop())
            current = current.next
        
        return root