-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolution.py
38 lines (32 loc) · 985 Bytes
/
solution.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
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
dummy = ListNode(-1)
p = dummy
carry = 0
while l1 and l2:
val = (l1.val + l2.val + carry) % 10
carry = (l1.val + l2.val + carry) / 10
p.next = ListNode(val)
p = p.next
l1 = l1.next
l2 = l2.next
remainder = l1 if l1 else l2
while remainder:
val = (remainder.val + carry) % 10
carry = (remainder.val + carry) / 10
p.next = ListNode(val)
p = p.next
remainder = remainder.next
if carry:
p.next = ListNode(carry)
return dummy.next