ds-algo-study
Version:
Just experimenting with publishing a package
17 lines (14 loc) • 791 B
JavaScript
// Work through this problem on https://leetcode.com/problems/minimum-path-sum/ and use the specs given there.
// Feel free to use this file for scratch work.
var minPathSum = function ( grid ) {
const table = new Array( grid.length ).fill().map( () => new Array( grid[ 0 ].length ).fill( Infinity ) );
table[ 0 ][ 0 ] = grid[ 0 ][ 0 ];
for ( let i = 0; i < grid.length; i++ ) {
for ( let j = 0; j < grid[ 0 ].length; j++ ) {
if ( j + 1 < grid[ 0 ].length ) table[ i ][ j + 1 ] = Math.min( table[ i ][ j ] + grid[ i ][ j + 1 ], table[ i ][ j + 1 ] );
if ( i + 1 < grid.length ) table[ i + 1 ][ j ] = Math.min( table[ i ][ j ] + grid[ i + 1 ][ j ], table[ i + 1 ][ j ] );
}
}
console.log( table );
return table[ grid.length - 1 ][ grid[ 0 ].length - 1 ];
};