LeetCode-Problems/2. Add Two Numbers.py at master · MiguelIslasH/LeetCode-Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
# 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:
        stack = []
        number1=""
        number2=""
        while(l1!=None):
            stack.append(l1.val) #2 4 3
            l1=l1.next

        for number in reversed(stack):
            number1=number1+str(number)
        stack = []

        while(l2!=None):
            stack.append(l2.val)
            l2=l2.next

        for number in reversed(stack):
            number2=number2+str(number)

        sumOfInversedNumbers = int(int(number1) + int(number2))
        flag=True
        pointer=ListNode(0)
        while(sumOfInversedNumbers!=0):
            digit = sumOfInversedNumbers%10
            sumOfInversedNumbers//=10
            if flag:
                solutionList = ListNode(digit)
                pointer = solutionList
                flag=False
            else:
                solutionList.next = ListNode(digit)
                solutionList = solutionList.next
        return pointer