-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2 Add Two Numbers.py
68 lines (61 loc) · 1.92 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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class ListNode(object):
def __init__(self, val=0, next=None):
self.val = val
self.next = next
class Solution(object):
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
new_list = ListNode()
p_new = None
p_l1 = l1
p_l2 = l2
flag_add_one = 0
while p_l1 or p_l2 or flag_add_one:
new_num = 0
# calculate sum
if p_l1 and p_l2:
new_num = p_l1.val + p_l2.val + flag_add_one
if new_num >= 10:
new_num = new_num%10
flag_add_one = 1
else:
flag_add_one = 0
p_l1 = p_l1.next
p_l2 = p_l2.next
elif p_l1 and not p_l2:
new_num = p_l1.val + flag_add_one
if new_num >= 10:
new_num = new_num%10
flag_add_one = 1
else:
flag_add_one = 0
p_l1 = p_l1.next
elif not p_l1 and p_l2:
new_num = p_l2.val + flag_add_one
if new_num >= 10:
new_num = new_num%10
flag_add_one = 1
else:
flag_add_one = 0
p_l2 = p_l2.next
else:
new_num = 1
flag_add_one = 0
# update linked list
if p_new == None:
p_new = new_list
p_new.val = new_num
else:
p_new.next = ListNode()
p_new = p_new.next
p_new.val = new_num
return new_list