2.Add Two Numbers

turing365

于 2019-04-01 06:29:20 发布

阅读量197

点赞数 1

CC 4.0 BY-SA版权

分类专栏： python leetcode 算法 leetcode解题之旅文章标签：算法 leetcode

本文链接：https://blog.youkuaiyun.com/turing365/article/details/88940214

python 同时被 3 个专栏收录

20 篇文章

订阅专栏

leetcode

16 篇文章

订阅专栏

算法

15 篇文章

订阅专栏

本文介绍了一种解决链表加法问题的方法，通过先将两个非空链表转换为整数并相加，然后将结果逆序转化为新的链表返回。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

2.Add Two Numbers

medium

代码还是不够熟练

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.

解法

一种偷懒的做法

先求和，再构建链表

def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        num1=''
        num2=''
        while l1:
            num1+=str(l1.val)
            l1=l1.next
        while l2:
            num2+=str(l2.val)
            l2=l2.next
        add=str(int(num1[::-1])+int(num2[::-1]))
        add=add[::-1]
        head=ListNode(add[0])
        answer=head
        for i in range(1,len(add)):
            node=ListNode(add[i])
            head.next=node
            head=head.next
        return answer