-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMain.js
69 lines (60 loc) · 1.55 KB
/
Main.js
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
const generateMatrix = () => {
let matrix = [];
let m = Math.floor(Math.random() * 10);
let n = Math.floor(Math.random() * 10);
for (let i = 0; i < m; i++) {
let row = [];
for (let j = 0; j < n; j++) {
row.push(Math.floor(Math.random() * 10));
}
matrix.push(row);
}
return matrix;
};
// solution function
const maxMoves = (dp, matrix, r, c) => {
let m = matrix.length;
let n = matrix[0].length;
if (c == n - 1) return c;
if (matrix[r][c + 1] > matrix[r][c]) {
if (dp[r][c + 1] != -1) {
return dp[r][c + 1];
}
return (dp[r][c + 1] = maxMoves(dp, matrix, r, c + 1));
}
if (r != 0 && matrix[r - 1][c + 1] > matrix[r][c]) {
if (dp[r - 1][c + 1] != -1) {
return dp[r - 1][c + 1];
}
return (dp[r - 1][c + 1] = maxMoves(dp, matrix, r - 1, c + 1));
}
if (r != m - 1 && matrix[r + 1][c + 1] > matrix[r][c]) {
if (dp[r + 1][c + 1] != -1) {
return dp[r + 1][c + 1];
}
return (dp[r + 1][c + 1] = maxMoves(dp, matrix, r + 1, c + 1));
} else return c;
};
const main = () => {
let m = 4;
let n = 4;
let matrix = generateMatrix();
// let matrix = [
// [2, 4, 3, 5],
// [5, 4, 9, 3],
// [3, 4, 2, 11],
// [10, 9, 13, 15],
// ];
let dp = new Array(m).fill(0);
let dp1 = new Array(m);
for (let i = 0; i < m; i++) {
dp1[i] = new Array(n + 1).fill(-1);
}
for (let i = 0; i < m; i++) {
dp[i] = Math.max(dp[Math.max(0, i - 1)], maxMoves(dp1, matrix, i, 0));
}
console.log(dp[m - 1]);
// console.log(matrix);
// console.log(dp1);
};
main();