Add Two Numbers

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.

给出两个 非空 的链表用来表示两个非负的整数。其中,它们各自的位数是按照 逆序 的方式存储的,并且它们的每个节点只能存储 一位 数字。

如果,我们将这两个数相加起来,则会返回一个新的链表来表示它们的和。

您可以假设除了数字 0 之外,这两个数都不会以 0 开头。

题目来源:力扣(LeetCode)链接:https://leetcode-cn.com/problems/add-two-numbers

Example:

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

python3:

class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None

class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        result = None
        temp_result = None
        added = 0
        while l1 is not None or l2 is not None:
            sum = added
            if l1 is not None:
                sum = sum + l1.val
                l1 = l1.next
            if l2 is not None:
                sum = sum + l2.val
                l2 = l2.next
            added = sum // 10
            sum = sum % 10
            if result is None:
                result = ListNode(sum)
                temp_result = result
            else:
                temp = ListNode(sum)
                temp_result.next = temp
                temp_result = temp_result.next
        if added > 0:
            temp = ListNode(added)
            temp_result.next = temp
        return result
Logo

瓜分20万奖金 获得内推名额 丰厚实物奖励 易参与易上手

更多推荐