-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsolution.py
More file actions
57 lines (47 loc) · 1.6 KB
/
Copy pathsolution.py
File metadata and controls
57 lines (47 loc) · 1.6 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
import json
import time
import numpy as np
triangle = """
75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 16 70 92
41 41 26 56 83 40 80 70 33
41 48 72 33 47 32 37 16 94 29
53 71 44 65 25 43 91 52 97 51 14
70 11 33 28 77 73 17 78 39 68 17 57
91 71 52 38 17 14 91 43 58 50 27 29 48
63 66 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23
"""
triangle = triangle.strip().split('\n')
def solution() -> int:
triangle_matrix = np.zeros((len(triangle), len(triangle)), dtype=np.int32)
for i, line in enumerate(triangle):
numbers = line.split(' ')
numbers = map(lambda x: int(x[0])*10 + int(x[1]), numbers)
for j, number in enumerate(numbers):
triangle_matrix[i,j] = number
path_matrix = np.zeros((len(triangle), len(triangle)), dtype=np.int32)
def _get_path_element(i, j):
try:
return path_matrix[i, j]
except IndexError:
return 0
for i in range(len(triangle)-1, -1, -1):
for j in range(len(triangle)-1, -1, -1):
if triangle_matrix[i, j] == 0:
continue
path_matrix[i, j] += triangle_matrix[i, j]
path_matrix[i, j] += max(_get_path_element(i+1, j),
_get_path_element(i+1, j+1))
return int(path_matrix[0, 0])
cpu_s, wall_s = time.process_time(), time.time()
result = solution()
cpu_e, wall_e = time.process_time(), time.time()
cpu_time, wall_time = cpu_e - cpu_s, wall_e - wall_s
print(json.dumps({"solution": result, "cpu": cpu_time, "wall": wall_time}))