2. Add Two Numbers

最新推荐文章于 2024-01-03 15:29:28 发布

原创最新推荐文章于 2024-01-03 15:29:28 发布 · 114 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

88 篇文章

订阅专栏

本文介绍了一种算法，该算法接收两个非空链表作为输入，这两个链表分别表示两个非负整数。这些数字以逆序方式存储，每个节点包含一个单独的数字。通过将这两个数字相加并返回一个新的链表来表示结果。

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

# 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
        """
        if not l1:
            return l2
        if not l2:
            return l1
        carry = 0
        head = ListNode(0)
        res = head
        while l1 and l2:
            add = l1.val+l2.val+carry
            if add<10:
                carry=0
            else:
                carry=1
            head.next=ListNode(add%10)
            head=head.next
            l1,l2=l1.next,l2.next
        if l1:
            l=l1
        else:
            l=l2
        while l:
            add = l.val+carry
            if add<10:
                carry=0
            else:
                carry=1
            head.next=ListNode(add%10)
            head=head.next
            l=l.next
        if carry:
            head.next=ListNode(1)
        return res.next