-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAdd Two Numbers.py
More file actions
35 lines (25 loc) · 1.02 KB
/
Copy pathAdd Two Numbers.py
File metadata and controls
35 lines (25 loc) · 1.02 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
# 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]:
dummy = ListNode()
curr = dummy
carry = 0
while l1 or l2 or carry:
val1 = l1.val if l1 else 0
val2 = l2.val if l2 else 0
#new digit
sum_val = val1 + val2 + carry
carry = sum_val // 10 #carry is the floor division - quotient
rem = sum_val % 10 #remainder is the modulus
curr.next = ListNode(rem)
curr = curr.next
#update ptrs
l1 = l1.next if l1 else None
l2 = l2.next if l2 else None
return dummy.next
#Time Complexity - O(n) iterating through listnodes n+n O(2n)
#Space - O(1)