002 Add Two Numbers

最新推荐文章于 2024-10-16 10:13:45 发布

sigmeta

最新推荐文章于 2024-10-16 10:13:45 发布

阅读量238

点赞数

分类专栏： Leetcode-py 文章标签： leetcode

本文链接：https://blog.csdn.net/sigmeta/article/details/73822835

版权

Leetcode-py 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

该博客介绍了如何解决LeetCode中的一道问题——将两个逆序存储、表示非负整数的链表相加。通过遍历链表，将每个节点的数值相加，并考虑进位，最终返回新的逆序链表表示的和。

摘要由CSDN通过智能技术生成

You are given two non-empty linked lists representing two non-negative integers. 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.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

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

class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        carry=0
        root=n=ListNode(0)
        while l1 or l2 or carry:
            v1=v2=0
            if l1:
                v1=l1.val
                l1=l1.next
            if l2:
                v2=l2.val
                l2=l2.next
            n.next=ListNode((v1+v2+carry)%10)
            n=n.next
            carry=(v1+v2+carry)//10
        return root.next