Leetcode刷题记录——面试题 02.05. 链表求和

我们实现的是上图中的进阶任务！
转化为字符串后操作 方便得多

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        str1 = ''
        str2 = ''
        cur = l1
        while cur is not None:
            str1 = str(cur.val) + str1#str1 += str(cur.val)
            cur = cur.next
        cur = l2
        while cur is not None:
            str2 = str(cur.val) + str2#str2 += str(cur.val)
            cur = cur.next
        suma = int(str1) + int(str2)
        sumstr = str(suma)
        print(sumstr)
        length = len(sumstr)
        head = None
        for i in range(length-1,-1,-1):
            if head == None:
                head = ListNode(int(sumstr[i]))
                cur = head
            else:
                cur.next = ListNode(int(sumstr[i]))
                cur = cur.next
        return head