Leetcode-2 两数相加

最新推荐文章于 2024-11-17 18:49:52 发布

原来是大海

最新推荐文章于 2024-11-17 18:49:52 发布

阅读量558

点赞数

文章标签： leetcode 链表算法

本文链接：https://blog.csdn.net/chw1234567/article/details/123440434

版权

在这里插入图片描述

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

        # 当前指针，结果链表
        result = curr = ListNode()
        # 进位项
        remainder = 0

        # 非空满足循环条件
        while l1 or l2 :
            x = l1.val if l1 else 0
            y = l2.val if l2 else 0

            total = x + y + remainder

            curr.next = ListNode(total%10)
            remainder = total//10

            print(x,y,remainder,total)

            # 🚩防止某一链表已经为空，空链表.next会报错
            if l1 : l1 = l1.next
            if l2 : l2 = l2.next
            curr = curr.next

        if remainder : curr.next = ListNode(remainder)
        return result.next
        
``