10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/cb0f98aea04386f6.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/cb0f98aea04386f6.js"],"default"] 12:T4df,class Solution: def maxProductPath(self, grid: List[List[int]]) -> int: mod = 10**9 + 7 m, n = len(grid), len(grid[0]) maxgt = [[0] * n for _ in range(m)] minlt = [[0] * n for _ in range(m)] maxgt[0][0] = minlt[0][0] = grid[0][0] for i in range(1, n): maxgt[0][i] = minlt[0][i] = maxgt[0][i - 1] * grid[0][i] for i in range(1, m): maxgt[i][0] = minlt[i][0] = maxgt[i - 1][0] * grid[i][0] for i in range(1, m): for j in range(1, n): if grid[i][j] >= 0: maxgt[i][j] = ( max(maxgt[i][j - 1], maxgt[i - 1][j]) * grid[i][j] ) minlt[i][j] = ( min(minlt[i][j - 1], minlt[i - 1][j]) * grid[i][j] ) else: maxgt[i][j] = ( min(minlt[i][j - 1], minlt[i - 1][j]) * grid[i][j] ) minlt[i][j] = ( max(maxgt[i][j - 1], maxgt[i - 1][j]) * grid[i][j] ) ans = maxgt[m - 1][n - 1] return ans % mod if ans >= 0 else -113:T427,class Solution { public int maxProductPath(int[][] grid) { int m = grid.length, n = grid[0].length; long[][] maxgt = new long[m][n], minlt = new long[m][n]; maxgt[0][0] = minlt[0][0] = grid[0][0]; for (int i = 1; i < n; i++) maxgt[0][i] = minlt[0][i] = maxgt[0][i-1] * grid[0][i]; for (int i = 1; i < m; i++) maxgt[i][0] = minlt[i][0] = maxgt[i-1][0] * grid[i][0]; for (int i = 1; i < m; i++) { for (int j = 1; j < n; j++) { if (grid[i][j] >= 0) { maxgt[i][j] = Math.max(maxgt[i-1][j], maxgt[i][j-1]) * grid[i][j]; minlt[i][j] = Math.min(minlt[i-1][j], minlt[i][j-1]) * grid[i][j]; } else { maxgt[i][j] = Math.min(minlt[i-1][j], minlt[i][j-1]) * grid[i][j]; minlt[i][j] = Math.max(maxgt[i-1][j], maxgt[i][j-1]) * grid[i][j]; } } } long ans = maxgt[m-1][n-1]; return ans < 0 ? -1 : (int)(ans % 1000000007); } }14:T463,class Solution { public: int maxProductPath(vector>& grid) { int m = grid.size(), n = grid[0].size(); vector> maxgt(m, vector(n)); vector> minlt(m, vector(n)); maxgt[0][0] = minlt[0][0] = grid[0][0]; for (int i = 1; i < n; i++) maxgt[0][i] = minlt[0][i] = maxgt[0][i-1] * grid[0][i]; for (int i = 1; i < m; i++) maxgt[i][0] = minlt[i][0] = maxgt[i-1][0] * grid[i][0]; for (int i = 1; i < m; i++) { for (int j = 1; j < n; j++) { if (grid[i][j] >= 0) { maxgt[i][j] = max(maxgt[i-1][j], maxgt[i][j-1]) * grid[i][j]; minlt[i][j] = min(minlt[i-1][j], minlt[i][j-1]) * grid[i][j]; } else { maxgt[i][j] = min(minlt[i-1][j], minlt[i][j-1]) * grid[i][j]; minlt[i][j] = max(maxgt[i-1][j], maxgt[i][j-1]) * grid[i][j]; } } } long long ans = maxgt[m-1][n-1]; return ans < 0 ? -1 : ans % 1000000007; } };15:T496,var maxProductPath = function(grid) { const m = grid.length, n = grid[0].length; const maxgt = Array.from({length: m}, () => new Array(n).fill(0n)); const minlt = Array.from({length: m}, () => new Array(n).fill(0n)); maxgt[0][0] = minlt[0][0] = BigInt(grid[0][0]); for (let i = 1; i < n; i++) maxgt[0

Time Complexity

Space Complexity