-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy path2906 Construct Product Matrix.py
77 lines (35 loc) · 1.54 KB
/
2906 Construct Product Matrix.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
class Solution:
def constructProductMatrix(self, grid: List[List[int]]) -> List[List[int]]:
MOD = 12345
l = []
for row in grid:
p = 1
row2 = []
for num in row:
p *= num
p %= MOD
row2.append(p)
l.append(row2)
ri = []
for row in grid:
p = 1
row2 = []
for num in row[::-1]:
p *= num
p %= MOD
row2.append(p)
ri.append(row2[::-1])
u = []
p = 1
for row in l:
p *= row[-1]
p %= MOD
u.append(p)
d = []
p = 1
for row in l[::-1]:
p *= row[-1]
p %= MOD
d.append(p)
d.reverse()
return [[(u[r-1] if r-1 >= 0 else 1)*(d[r+1] if r+1 < len(grid) else 1)*(l[r][c-1] if c-1 >= 0 else 1)*(ri[r][c+1] if c+1 < len(grid[0]) else 1)%MOD for c in range(len(grid[0]))] for r in range(len(grid))]