-
Notifications
You must be signed in to change notification settings - Fork 0
/
2. Add Two Numbers.py
52 lines (52 loc) · 1.57 KB
/
2. Add Two Numbers.py
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
# 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]:
ptr1, ptr2 = l1, l2
ans = ListNode(None)
cur = ans
carry = 0
while l1 or l2:
val1 = val2 = 0
if l1:
val1 = l1.val
l1 = l1.next
if l2:
val2 = l2.val
l2 = l2.next
carry, node_val = divmod(val1+val2+carry,10)
cur.next = ListNode(node_val)
cur = cur.next
if carry:
cur.next = ListNode(carry)
return ans.next
# naive
#n = 0
#i = 0
#while l1 or l2:
# if l1:
# n += l1.val * 10**i
# l1 = l1.next
# if l2:
# n += l2.val * 10**i
# l2 = l2.next
# i += 1
#n, r = divmod(n, 10)
#ans = ListNode(r)
#ans_tail = ans
#while n > 0:
# n, r = divmod(n, 10)
# ans_tail.next = ListNode(r)
# ans_tail = ans_tail.next
#return ans