-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2d_array.py
More file actions
33 lines (27 loc) · 1021 Bytes
/
Copy path2d_array.py
File metadata and controls
33 lines (27 loc) · 1021 Bytes
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
def compute_sum(arr, x_start, x_end, y_start, y_end):
x_middle_element = int((x_start + x_end) / 2)
y_middle_element = int((y_start + y_end) / 2)
sum_x = 0
for i in range(x_start, x_end+1):
if i == x_middle_element:
continue
for j in range(y_start, y_end+1):
sum_x += arr[i][j]
return sum_x + arr[x_middle_element][y_middle_element]
def compute_all_hourglass_sum(arr):
largest_hourglass_sum = -100
for i in range(int(len(arr)/2)+1):
for j in range(int(len(arr[i])/2)+1):
hourglass_sum = compute_sum(arr, i, i+2, j, j+2)
if hourglass_sum > largest_hourglass_sum:
largest_hourglass_sum = hourglass_sum
return largest_hourglass_sum
if __name__ == '__main__':
arr = [[1, 1, 1, 0, 0, 0],
[0, 1, 0, 0, 0, 0],
[1, 1, 1, 0, 0, 0],
[0, 0, 2, 4, 4, 0],
[0, 0, 0, 2, 0, 0],
[0, 0, 1, 2, 4, 0]
]
print(compute_all_hourglass_sum(arr))