Commit469640f

authored

Create 1289-minimum-falling-path-sum-ii.js

Solved minimum-falling-path-sum-ii

1 parent3a66f08 commit469640fCopy full SHA for 469640f

File tree

+26

-0

lines changed

+26

-0

lines changed

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,26 @@`
	`1`	`+/**`
	`2`	`+ * Recursive DP \| Memoization`
	`3`	`+ * Time O(n^3) \| Space O(1)`
	`4`	`+ * https://leetcode.com/problems/minimum-falling-path-sum-ii/`
	`5`	`+ * Tip (This is just like recursive solution but you're doing it in for loop instead of callStack)`
	`6`	`+ *@param {number[][]} grid`
	`7`	`+ *@return {number}`
	`8`	`+ */`
	`9`	`+varminFallingPathSum=function(grid){`
	`10`	`+`
	`11`	`+constROW=grid.length;`
	`12`	`+constCOL=grid[0].length;`
	`13`	`+`
	`14`	`+for(letrow=ROW-2;row>-1;row--){`
	`15`	`+for(letcol=0;col<COL;col++){`
	`16`	`+constoriginalCellVal=grid[row][col];`
	`17`	`+grid[row][col]=Infinity;`
	`18`	`+for(letnextRowCol=0;nextRowCol<COL;nextRowCol++){`
	`19`	`+if(nextRowCol===col)continue;`
	`20`	`+grid[row][col]=Math.min(grid[row][col],originalCellVal+grid[row+1][nextRowCol])`
	`21`	`+}`
	`22`	`+}`
	`23`	`+}`
	`24`	`+`
	`25`	`+returnMath.min(...grid[0]);`
	`26`	`+};`

Comments

(0)