leetcode 之 Add Two Numbers（链表）

最新推荐文章于 2024-09-12 19:02:20 发布

little_zozo

最新推荐文章于 2024-09-12 19:02:20 发布

阅读量125

点赞数 1

分类专栏： leetcode 文章标签：算法 python

本文链接：https://blog.csdn.net/weixin_46995523/article/details/106465075

版权

leetcode 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

问题描述：

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.

mycode:

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

class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        
        lst = []
        count = 0
        for i in range(100000):     
            r = l1.val + l2.val
            if r > 9:
                r = r + count 
                r = r - 10
                count = 1
            else:
                r = r + count
                if r > 9:
                    r = r - 10
                    count = 1
                else:
                    count = 0
            l1 = l1.next
            l2 = l2.next
            lst.append(r)
            if l1 == None or l2==None:
                
                if l1 != None:
                    while l1 != None:
                        r = l1.val + count
                        if r > 9:
                            lst.append(r-10)
                            if l1.next == None:
                                lst.append(1)
                                count = 0
                            else:
                                count = 1
                        else:
                            lst.append(r)
                            count = 0
                        
                        l1 = l1.next
                    
                elif l2 != None:
                    while l2 != None:
                        
                        r = l2.val + count
                        if r > 9:
                            lst.append(r-10)
                            if l2.next == None:
                                lst.append(1)
                                count = 0
                            else:
                                count = 1
                        else:
                            lst.append(r)
                            count = 0
                        l2 = l2.next
                break
        if count == 1:
            lst.append(1)   
            
            
            
        result = ListNode()
        for i in range(len(lst)):
            node = ListNode(lst[i])
            if i == 0:
                result.val = lst[i]
            else:
                c = result
                while c.next != None:
                    c = c.next
                c.next = node
                   
        return result

Runtime: 68ms
但是Memory Usage: 14 M
（捂脸哭）