Skip to content

Commit df2bef3

Browse files
authored
Create 2328-number-of-increasing-paths-in-a-grid.js
1 parent 3d81dc9 commit df2bef3

File tree

1 file changed

+37
-0
lines changed

1 file changed

+37
-0
lines changed
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
/**
2+
* @param {number[][]} grid
3+
* @return {number}
4+
*/
5+
var countPaths = function(grid) {
6+
let MOD = 1e9 + 7;
7+
let res = 0;
8+
let M = grid.length, N = grid[0].length;
9+
10+
const dp = Array.from({ length: M }, () => Array(N))
11+
12+
for (let r = 0; r < M; r++) {
13+
for (let c = 0; c < N; c++) {
14+
res = (res + dfs(grid, r, c, dp)) % MOD;
15+
}
16+
}
17+
return res;
18+
19+
function dfs(grid, r, c, dp) {
20+
if (dp[r][c] != null) {
21+
return dp[r][c];
22+
}
23+
let MOD = 1e9 + 7;
24+
let res = 1;
25+
let M = grid.length, N = grid[0].length;
26+
27+
for (const dir of [[-1, 0], [0, -1], [1, 0], [0, 1]]) {
28+
let nr = r + dir[0], nc = c + dir[1];
29+
if (nr < 0 || nr >= M || nc < 0 || nc >= N || grid[nr][nc] <= grid[r][c]) {
30+
continue;
31+
}
32+
res = (res + dfs(grid, nr, nc, dp))%MOD;
33+
}
34+
dp[r][c] = res;
35+
return res;
36+
}
37+
};

0 commit comments

Comments
 (0)