-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy path2.linningmii.py
72 lines (54 loc) · 1.47 KB
/
2.linningmii.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
69
70
71
72
# Definition for singly-linked list.
class ListNode:
def __init__(self, x):
self.val = x
self.next = None
class Solution:
def get_val(self, node):
if node is not None:
return node.val
else:
return 0
def digit_up(self, node):
if node.next is not None:
node.next.val += 1
if node.next.val == 10:
node.next.val = 0
self.digit_up(node.next)
else:
node.next = ListNode(1)
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
l1_node = l1
l2_node = l2
result = []
while l1_node or l2_node:
val1 = self.get_val(l1_node)
val2 = self.get_val(l2_node)
if val1 + val2 >= 10:
result.append(val1 + val2 - 10)
self.digit_up(l1_node)
else:
result.append(val1 + val2)
print(result)
if l1_node:
l1_node = l1_node.next
if l2_node:
l2_node = l2_node.next
return result
node1_0 = ListNode(3)
node1_1 = ListNode(4)
node1_2 = ListNode(2)
node1_0.next = node1_1
node1_1.next = node1_2
node2_0 = ListNode(4)
node2_1 = ListNode(6)
node2_2 = ListNode(5)
node2_0.next = node2_1
node2_1.next = node2_2
solution = Solution()
print(solution.addTwoNumbers(node1_0, node2_0))