常见的宽基指数基金

文章目录

• 思路
• 解题方法
• 复杂度
• Code

思路

解题方法

复杂度

时间复杂度:

空间复杂度:

Code

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]:
        num1, num2 = [], []
        while l1:
            num1.insert(0, l1.val)
            l1 = l1.next
        while l2:
            num2.insert(0, l2.val)
            l2 = l2.next
        num1 = int("".join(map(str, num1)))
        num2 = int("".join(map(str, num2)))
        sum_num = str(num1 + num2)
        sum_list = []
        for char in sum_num:
            sum_list.append(char)
        head = p = ListNode(None)
        while len(sum_list)>0:
            p.next = ListNode(int(sum_list.pop(-1)))
            p = p.next
        return head.next