From 993788e933a531e9b688e409877eba3a850bac54 Mon Sep 17 00:00:00 2001 From: DhruvGheewala Date: Wed, 9 Dec 2020 15:51:18 +0530 Subject: [PATCH 1/3] Update MinimumCostPath.js --- Dynamic-Programming/MinimumCostPath.js | 55 +++++++++++++------------- 1 file changed, 28 insertions(+), 27 deletions(-) diff --git a/Dynamic-Programming/MinimumCostPath.js b/Dynamic-Programming/MinimumCostPath.js index 3936f0af71..22d2b63c15 100644 --- a/Dynamic-Programming/MinimumCostPath.js +++ b/Dynamic-Programming/MinimumCostPath.js @@ -1,37 +1,38 @@ -// youtube Link -> https://www.youtube.com/watch?v=lBRtnuxg-gU +// Problem Statement => https://www.youtube.com/watch?v=lBRtnuxg-gU const minCostPath = (matrix) => { - /* - Find the min cost path from top-left to bottom-right in matrix - >>> minCostPath([[2, 1], [3, 1], [4, 2]]) - 6 - */ - const n = matrix.length - const m = matrix[0].length + /* + Find the min cost path from top-left to bottom-right in matrix + >>> minCostPath([[2, 1], [3, 1], [4, 2]]) + >>> 6 + */ - // Preprocessing first row - for (let i = 1; i < m; i++) { - matrix[0][i] += matrix[0][i - 1] - } + const n = matrix.length; + const m = matrix[0].length; - // Preprocessing first column - for (let i = 1; i < n; i++) { - matrix[i][0] += matrix[i - 1][0] - } + // moves[i][j] => minimum number of moves to reach cell i, j + let moves = new Array(n); + for (var i = 0; i < moves.length; i++) + moves[i] = new Array(m); + + // base conditions + moves[0][0] = 0; // to reach cell (0, 0) from (0, 0) is of no moves + for (var i = 1; i < m; i++) + moves[0][i] = moves[0][i - 1] + matrix[0][i]; + for (var i = 1; i < n; i++) + moves[i][0] = moves[i - 1][0] + matrix[i][0]; - // Updating cost to current position - for (let i = 1; i < n; i++) { - for (let j = 1; j < m; j++) { - matrix[i][j] += Math.min(matrix[i - 1][j], matrix[i][j - 1]) + for (var i = 1; i < n; i++) { + for (var j = 1; j < m; j++) + moves[i][j] = Math.min(moves[i - 1][j], moves[i][j - 1]) + matrix[i][j]; } - } - return matrix[n - 1][m - 1] -} + return moves[n - 1][m - 1]; +}; const main = () => { - console.log(minCostPath([[2, 1], [3, 1], [4, 2]])) - console.log(minCostPath([[2, 1, 4], [2, 1, 3], [3, 2, 1]])) -} + console.log(minCostPath([[2, 1], [3, 1], [4, 2]])); + console.log(minCostPath([[2, 1, 4], [2, 1, 3], [3, 2, 1]])); +}; -main() +main(); \ No newline at end of file From cec1d7d02db915ea51f17f6a6fb4c9369ce1291a Mon Sep 17 00:00:00 2001 From: DhruvGheewala Date: Wed, 9 Dec 2020 16:17:41 +0530 Subject: [PATCH 2/3] Update MinimumCostPath.js --- Dynamic-Programming/MinimumCostPath.js | 63 +++++++++++++++----------- 1 file changed, 36 insertions(+), 27 deletions(-) diff --git a/Dynamic-Programming/MinimumCostPath.js b/Dynamic-Programming/MinimumCostPath.js index 22d2b63c15..cc4100334a 100644 --- a/Dynamic-Programming/MinimumCostPath.js +++ b/Dynamic-Programming/MinimumCostPath.js @@ -1,38 +1,47 @@ // Problem Statement => https://www.youtube.com/watch?v=lBRtnuxg-gU const minCostPath = (matrix) => { - /* + /* Find the min cost path from top-left to bottom-right in matrix >>> minCostPath([[2, 1], [3, 1], [4, 2]]) >>> 6 */ - const n = matrix.length; - const m = matrix[0].length; - - // moves[i][j] => minimum number of moves to reach cell i, j - let moves = new Array(n); - for (var i = 0; i < moves.length; i++) - moves[i] = new Array(m); - - // base conditions - moves[0][0] = 0; // to reach cell (0, 0) from (0, 0) is of no moves - for (var i = 1; i < m; i++) - moves[0][i] = moves[0][i - 1] + matrix[0][i]; - for (var i = 1; i < n; i++) - moves[i][0] = moves[i - 1][0] + matrix[i][0]; - - for (var i = 1; i < n; i++) { - for (var j = 1; j < m; j++) - moves[i][j] = Math.min(moves[i - 1][j], moves[i][j - 1]) + matrix[i][j]; - } - - return moves[n - 1][m - 1]; -}; + const n = matrix.length + const m = matrix[0].length + + // moves[i][j] => minimum number of moves to reach cell i, j + let moves = new Array(n) + for (var i = 0; i < moves.length; i++) moves[i] = new Array(m) + + // base conditions + moves[0][0] = 0 // to reach cell (0, 0) from (0, 0) is of no moves + for (var i = 1; i < m; i++) moves[0][i] = moves[0][i - 1] + matrix[0][i] + for (var i = 1; i < n; i++) moves[i][0] = moves[i - 1][0] + matrix[i][0] + + for (var i = 1; i < n; i++) { + for (var j = 1; j < m; j++) + moves[i][j] = Math.min(moves[i - 1][j], moves[i][j - 1]) + matrix[i][j] + } + + return moves[n - 1][m - 1] +} const main = () => { - console.log(minCostPath([[2, 1], [3, 1], [4, 2]])); - console.log(minCostPath([[2, 1, 4], [2, 1, 3], [3, 2, 1]])); -}; + console.log( + minCostPath([ + [2, 1], + [3, 1], + [4, 2] + ]) + ) + console.log( + minCostPath([ + [2, 1, 4], + [2, 1, 3], + [3, 2, 1] + ]) + ) +} -main(); \ No newline at end of file +main() From c85c692ebff6aebbf86d1f5483cd9d398c6eb3cf Mon Sep 17 00:00:00 2001 From: DhruvGheewala Date: Wed, 9 Dec 2020 16:21:44 +0530 Subject: [PATCH 3/3] Update MinimumCostPath.js --- Dynamic-Programming/MinimumCostPath.js | 13 ++++++------- 1 file changed, 6 insertions(+), 7 deletions(-) diff --git a/Dynamic-Programming/MinimumCostPath.js b/Dynamic-Programming/MinimumCostPath.js index cc4100334a..ced0d894a2 100644 --- a/Dynamic-Programming/MinimumCostPath.js +++ b/Dynamic-Programming/MinimumCostPath.js @@ -11,17 +11,16 @@ const minCostPath = (matrix) => { const m = matrix[0].length // moves[i][j] => minimum number of moves to reach cell i, j - let moves = new Array(n) - for (var i = 0; i < moves.length; i++) moves[i] = new Array(m) + const moves = new Array(n) + for (let i = 0; i < moves.length; i++) moves[i] = new Array(m) // base conditions moves[0][0] = 0 // to reach cell (0, 0) from (0, 0) is of no moves - for (var i = 1; i < m; i++) moves[0][i] = moves[0][i - 1] + matrix[0][i] - for (var i = 1; i < n; i++) moves[i][0] = moves[i - 1][0] + matrix[i][0] + for (let i = 1; i < m; i++) moves[0][i] = moves[0][i - 1] + matrix[0][i] + for (let i = 1; i < n; i++) moves[i][0] = moves[i - 1][0] + matrix[i][0] - for (var i = 1; i < n; i++) { - for (var j = 1; j < m; j++) - moves[i][j] = Math.min(moves[i - 1][j], moves[i][j - 1]) + matrix[i][j] + for (let i = 1; i < n; i++) { + for (let j = 1; j < m; j++) { moves[i][j] = Math.min(moves[i - 1][j], moves[i][j - 1]) + matrix[i][j] } } return moves[n - 1][m - 1]