Why my solution is not working?
Amit Biswas
92
RecursionJavaScript
  1. Minimum Path Sum

Input:
[[5,0,1,1,2,1,0,1,3,6,3,0,7,3,3,3,1],[1,4,1,8,5,5,5,6,8,7,0,4,3,9,9,6,0],[2,8,3,3,1,6,1,4,9,0,9,2,3,3,3,8,4],[3,5,1,9,3,0,8,3,4,3,4,6,9,6,8,9,9],[3,0,7,4,6,6,4,6,8,8,9,3,8,3,9,3,4],[8,8,6,8,3,3,1,7,9,3,3,9,2,4,3,5,1],[7,1,0,4,7,8,4,6,4,2,1,3,7,8,3,5,4],[3,0,9,6,7,8,9,2,0,4,6,3,9,7,2,0,7],[8,0,8,2,6,4,4,0,9,3,8,4,0,4,7,0,4],[3,7,4,5,9,4,9,7,9,8,7,4,0,4,2,0,4],[5,9,0,1,9,1,5,9,5,5,3,4,6,9,8,5,6],[5,7,2,4,4,4,2,1,8,4,8,0,5,4,7,4,7],[9,5,8,6,4,4,3,9,8,1,1,8,7,7,3,6,9],[7,2,3,1,6,3,6,6,6,3,2,3,9,9,4,4,8]]
Output:
87
Expected:
83

function minPathSum(grid: number[][]): number {
    let map = new Map<string,number>()
    return helper(grid,0,0,map)
};

function helper(grid: number[][], i: number, j: number, map: Map<string,number>){
    
    if(i>grid.length-1 || j>grid[0].length-1) return Infinity
    
    
    if(map.has(i+""+j)) return map.get(i+""+j)
    
    let min = 0
    if(i==grid.length-1 && j==grid[0].length-1){
        return grid[i][j]
    } 
    
    min = grid[i][j] + Math.min(helper(grid,i+1,j,map),helper(grid,i,j+1,map))
    
    map.set(i+""+j,min)
    
    return min
    
    
}
Comments (1)