LeetCode 第二题 Add Two Numbers

最新推荐文章于 2024-08-12 10:14:14 发布

shifanfashi

最新推荐文章于 2024-08-12 10:14:14 发布

阅读量353

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode python练习 LeetCode 文章标签： LeetCode

本文链接：https://blog.youkuaiyun.com/shifanfashi/article/details/89636809

python练习同时被 3 个专栏收录

27 篇文章

订阅专栏

LeetCode

10 篇文章

订阅专栏

LeetCode

9 篇文章

订阅专栏

本文介绍了一种使用链表实现加法运算的方法。具体地，两个非空链表表示两个非负整数，数字以逆序存储，每个节点包含一个数字。通过递归方式将两个数字相加，并以链表形式返回结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

class Solution:
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        if not l1 and not l2:
            return 
        elif not (l1 and l2):
            return l1 or l2
        else:
            if l1.val + l2.val < 10:
                l3 = ListNode(l1.val+l2.val)
                l3.next = self.addTwoNumbers(l1.next, l2.next)
            else:
                l3 = ListNode(l1.val+l2.val-10)
                l3.next = self.addTwoNumbers(l1.next, self.addTwoNumbers(l2.next, ListNode(1)))
        return l3