Add solution #64

JoshCrozier · JoshCrozier · commit 1f82cdf3a05f · 2023-01-24T23:55:17.000-06:00
diff --git a/0064-minimum-path-sum.js b/0064-minimum-path-sum.js
@@ -0,0 +1,28 @@
+/**
+ * 64. Minimum Path Sum
+ * https://leetcode.com/problems/minimum-path-sum/
+ * Difficulty: Medium
+ *
+ * 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
+ * its path.
+ *
+ * Note: You can only move either down or right at any point in time.
+ */
+
+/**
+ * @param {number[][]} grid
+ * @return {number}
+ */
+var minPathSum = function(grid) {
+  for (let i = 0; i < grid.length; i++) {
+    for (let j = 0; j < grid[0].length; j++) {
+      if (i === 0 && j === 0) grid[i][j] = grid[i][j];
+      else if (i === 0 && j !== 0) grid[i][j] = grid[i][j] + grid[i][j - 1];
+      else if (i !== 0 && j === 0) grid[i][j] = grid[i][j] + grid[i - 1][j];
+      else grid[i][j] = grid[i][j] + Math.min(grid[i - 1][j], grid[i][j - 1]);
+    }
+  }
+
+  return grid[grid.length - 1][grid[0].length - 1];
+};
diff --git a/README.md b/README.md
@@ -64,6 +64,7 @@
 58|[Length of Last Word](./0058-length-of-last-word.js)|Easy|
 59|[Spiral Matrix II](./0059-spiral-matrix-ii.js)|Medium|
 62|[Unique Paths](./0062-unique-paths.js)|Medium|
+64|[Minimum Path Sum](./0064-minimum-path-sum.js)|Medium|
 66|[Plus One](./0066-plus-one.js)|Easy|
 67|[Add Binary](./0067-add-binary.js)|Easy|
 69|[Sqrt(x)](./0069-sqrtx.js)|Medium|
