-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2_Add_Two_Numbers.py
More file actions
75 lines (70 loc) · 1.77 KB
/
2_Add_Two_Numbers.py
File metadata and controls
75 lines (70 loc) · 1.77 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
# coding=utf-8
# 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
"""
a = ListNode(0)
p = a
flag = 0
while l1 and l2:
tmp = l1.val + l2.val + flag
if tmp > 9:
tmp -= 10
flag = 1
else:
flag = 0
p.next = ListNode(tmp)
p = p.next
l1 = l1.next
l2 = l2.next
while l1:
if flag == 1: # 有进位
l1.val += flag
if l1.val > 9:
l1.val -= 10
flag = 1
else:
flag = 0
p.next = ListNode(l1.val)
l1 = l1.next
p = p.next
else:
p.next = l1
break
while l2:
if flag == 1:
l2.val += flag # 有进位
if l2.val > 9:
l2.val -= 10
flag = 1
else:
flag = 0
p.next = ListNode(l2.val)
l2 = l2.next
p = p.next
else:
p.next = l2
break
if flag == 1:
p.next = ListNode(1)
# p = p.next
return a.next
def new_print(self, x):
while x:
print x.val
x = x.next
if __name__ == '__main__':
a = ListNode(1)
a.next = ListNode(8)
b = ListNode(0)
c = Solution()
d = c.addTwoNumbers(a, b)
c.new_print(d)