64. Minimum Path Sum (java)

Author: bluesword12350

Diff for: solution/0064.Minimum Path Sum/Solution.java

@@ -0,0 +1,9 @@
+class Solution {
+    public int minPathSum(int[][] grid) {
+        for (int i = 1; i < grid.length; i++) grid[i][0] += grid[i - 1][0];
+        for (int j = 1; j < grid[0].length; j++) grid[0][j] += grid[0][j - 1];
+        for (int i = 1; i < grid.length; i++)
+            for (int j = 1; j < grid[0].length; j++) grid[i][j] += Math.min(grid[i - 1][j], grid[i][j - 1]);
+        return grid[grid.length-1][grid[0].length-1];
+    }
+}