René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/minimum-path-sum","name":"#64 - Minimum Path Sum - LeetCode JavaScript Solutions","description":"Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[][]} grid\n * @return {number}\n */\nvar minPathSum = function(grid) {\n  for (let i = 0; i < grid.length; i++) {\n    for (let j = 0; j < grid[0].length; j++) {\n      if (i === 0 && j === 0) grid[i][j] = grid[i][j];\n      else if (i === 0 && j !== 0) grid[i][j] = grid[i][j] + grid[i][j - 1];\n      else if (i !== 0 && j === 0) grid[i][j] = grid[i][j] + grid[i - 1][j];\n      else grid[i][j] = grid[i][j] + Math.min(grid[i - 1][j], grid[i][j - 1]);\n    }\n  }\n\n  return grid[grid.length - 1][grid[0].length - 1];\n};","keywords":"LeetCode 64, #64 - Minimum Path Sum, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}