-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAddTwoNumbers.py
More file actions
executable file
·105 lines (70 loc) · 2.35 KB
/
Copy pathAddTwoNumbers.py
File metadata and controls
executable file
·105 lines (70 loc) · 2.35 KB
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
"""
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 contains a single digit. Add the two numbers and return the sum as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Example 1:
Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.
Example 2:
Input: l1 = [0], l2 = [0]
Output: [0]
Example 3:
Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output: [8,9,9,9,0,0,0,1]
Constraints:
The number of nodes in each linked list is in the range [1, 100].
0 <= Node.val <= 9
It is guaranteed that the list represents a number that does not have leading zeros.
"""
# 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, l2):
carry = 0
dummy = ListNode()
current = dummy
while l1 or l2:
x = l1.val if l1 else 0
y = l2.val if l2 else 0
_sum = x + y + carry
carry = _sum // 10
current.next = ListNode(_sum % 10)
current = current.next
if l1:
l1 = l1.next
if l2:
l2 = l2.next
if carry > 0:
current.next = ListNode(carry)
return dummy.next
# Helper function to create a linked list from a list of values
def create_linked_list(values):
if not values:
return None
head = ListNode(values[0])
current = head
for val in values[1:]:
current.next = ListNode(val)
current = current.next
return head
# Helper function to convert a linked list to a list for easy printing
def linked_list_to_list(head):
result = []
while head:
result.append(head.val)
head = head.next
return result
if __name__ == "__main__":
# Create linked lists representing the two numbers
num1 = [2, 4, 3]
num2 = [5, 6, 4]
l1 = create_linked_list(num1)
l2 = create_linked_list(num2)
solution = Solution()
result = solution.addTwoNumbers(l1, l2)
# Convert the result linked list to a list
result_list = linked_list_to_list(result)
print(result_list) # This should print the result of adding the two numbers.