python leetcode 2. Add Two Numbers

最新推荐文章于 2021-12-02 14:05:46 发布

DreamerLHQ

最新推荐文章于 2021-12-02 14:05:46 发布

阅读量166

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode_python 文章标签： python leetcode

本文链接：https://blog.youkuaiyun.com/DreamerLHQ/article/details/88996631

leetcode_python 专栏收录该内容

71 篇文章

订阅专栏

本文介绍了一种算法，该算法接收两个非空链表作为输入，这两个链表分别代表两个非负整数。链表以逆序方式存储数字，并且每个节点包含一个单独的数字。文章详细阐述了如何将这两个数字相加并返回结果作为一个新的链表。

摘要生成于 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 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 l1 == None:
            return l2
        if l2 == None:
            return l1
        tmp = ListNode(0)
        ans = tmp
        flag = 0
        while l1 and l2:
            tmp.next = ListNode((l1.val+l2.val+flag)%10)
            flag = (l1.val+l2.val+flag)//10
            l1 = l1.next
            l2 = l2.next
            tmp = tmp.next
        # 若l1未遍历完
        if l1:
            while l1:
                tmp.next = ListNode((l1.val + flag) % 10)
                flag = (l1.val + flag) // 10
                l1 = l1.next
                tmp = tmp.next
        # 若l2未遍历完
        if l2:
            while l2:
                tmp.next = ListNode((l2.val + flag) % 10)
                flag = (l2.val + flag) // 10
                l2 = l2.next
                tmp = tmp.next
        # 若flag存在（进位情况）
        if flag:
            tmp.next = ListNode(1)
        return ans.next