-
Notifications
You must be signed in to change notification settings - Fork 0
/
largest-product-in-grid.py
97 lines (77 loc) · 3.99 KB
/
largest-product-in-grid.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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
raw = "08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48"
grid = raw.split()
finGrid2020 = []
for i in range(0, len(grid), 20):
finGrid2020.append(grid[i : (i + 20)])
finGrid2020 = [[int(num) for num in row] for row in finGrid2020]
def largestProdInGrid(grid, adj):
products = []
for i in range(len(grid)):
pivLoc = 0
locProds = []
while pivLoc <= len(grid[i]) - adj + 1:
rowAdjs = []
colAdjs = []
LDiagAdjs = []
RDiagAdjs = []
for j in range(adj):
if pivLoc + j <= len(grid[i]) - adj + 1:
if grid[i][pivLoc + j] != 0:
rowAdjs.append(grid[i][pivLoc + j])
else:
break
else:
break
for k in range(adj):
if i + j <= len(grid) - adj + 1:
if grid[i + k][pivLoc] != 0:
colAdjs.append(grid[i + k][pivLoc])
else:
break
else:
break
for l in range(adj):
if i + l <= len(grid) - adj + 1 and pivLoc - adj + 1 >= 0:
if grid[i + l][pivLoc - l] != 0:
LDiagAdjs.append(grid[i + l][pivLoc - l])
else:
break
else:
break
for m in range(adj):
if i + m <= len(grid) - adj + 1 and len(grid[m]) - pivLoc >= adj:
if grid[i + m][pivLoc + m] != 0:
RDiagAdjs.append(grid[i + m][pivLoc + m])
else:
break
else:
break
pivLoc += 1
# print("row: ", rowAdjs)
# print("col: ", colAdjs)
# print("left diag: ", LDiagAdjs)
# print("right diag: ", RDiagAdjs)
locRProd = 1
locCProd = 1
locLDProd = 1
locRDProd = 1
if len(rowAdjs) == adj:
for num in rowAdjs:
locRProd *= num
locProds.append(locRProd)
if len(colAdjs) == adj:
for num in colAdjs:
locCProd *= num
locProds.append(locCProd)
if len(LDiagAdjs) == adj:
for num in LDiagAdjs:
locLDProd *= num
locProds.append(locLDProd)
if len(RDiagAdjs) == adj:
for num in RDiagAdjs:
locRDProd *= num
locProds.append(locRDProd)
products.append(max(locProds))
return(max(products))
print(largestProdInGrid(finGrid2020, 4))
# print(largestProdInGrid([[1, 2, 4], [9, 3, 6], [9, 4, 7]], 2))