Add Two Numbers

最新推荐文章于 2025-12-28 16:25:57 发布

原创最新推荐文章于 2025-12-28 16:25:57 发布 · 516 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#数据结构 #算法 #学习

LeetCode 专栏收录该内容

111 篇文章

订阅专栏

本文将介绍如何利用Python解决链表形式表示的非负整数相加问题，重点在于理解并实现链表节点操作及进位处理。

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

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
        """
        res = []
        if l1 is None:
            return l2
        if l2 == None:
            return l1
        b = 0
        node1 = l1
        node2 = l2
        res = ListNode(0)
        node3 = res
        while node1 is not None or node2 is not None :
            if node1 is None:
                a = node2.val + b
                node2 = node2.next
            elif node2 is None:
                a = node1.val + b
                node1 = node1.next
            else:
                a = node1.val + node2.val + b
                node1 = node1.next
                node2 = node2.next

            if a >= 10:
                val = a - 10
                b = 1
            else:
                val = a
                b = 0

            node3.next = ListNode(val)
            node3 = node3.next
        if b == 1:
            node3.next = ListNode(1)

        return res.next