[LeeCode]Add Two Numbers

最新推荐文章于 2025-08-08 00:00:33 发布

原创最新推荐文章于 2025-08-08 00:00:33 发布 · 370 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

Python 专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一种使用链表表示非负整数并实现两个链表相加的方法。链表中的数字以逆序存储，每个节点包含一个数字。文章提供了一个Python实现示例。

摘要生成于 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.

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

Subscribe to see which companies asked this question.

class Solution(object):
    def addTwoNumbers(self, l1, l2):
        Head = ListNode(0)
        ans = Head
        rem  = 0
        while True:
            if l1 != None:
                rem += l1.val
                l1 = l1.next
            if l2 != None:
                rem += l2.val
                l2 = l2.next
            ans.val = rem % 10
            rem /= 10
            if l1 != None or l2 != None or rem != 0:
                ans.next = ListNode(0)
                ans = ans.next
            else: break

        return Head