Breaking News: Grepper is joining You.com. Read the official announcement!

Minimum Path Sum for loop

ABS answered on July 21, 2022 Popularity 9/10 Helpfulness 1/10

answer Minimum Path Sum for loop

Minimum Path Sum for loop

Comment

var minPathSum = function(grid) {
    const n = grid.length
    const m = grid[0].length

    
    for( let i =1; i<n;i++){
        grid[i][0] += grid[i-1][0]
    }
    
    for(let j=1; j<m;j++){
        grid[0][j] += grid[0][j-1]
    }
    
    for(let i=1; i<n;i++){
        for(let j=1;j<m;j++){
            grid[i][j] += Math.min(grid[i-1][j],grid[i][j-1])
        }
    }
    
    return grid[n-1][m-1]
};

Popularity 9/10 Helpfulness 1/10 Language javascript

Source: Grepper

Tags: for-loop javascript minimum path sum

Link to this answer
Share Copy Link

Contributed on Jul 21 2022

ABS

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

Minimum Path Sum for loop

Contents

More Related Answers

Minimum Path Sum for loop

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.