0064-minimum-path-sum.java

classSolution {

publicintminPathSum(int[][] grid) {
intm = grid.length - 1;
intn = grid[0].length - 1;
int[][] dp = newint[m + 1][n + 1];
for (int[] arr : dp) {
Arrays.fill(arr, -1);
 }
returnhelper(grid, m, n, dp);
 }

publicinthelper(int[][] grid, intm, intn, int[][] dp) {
if (m == 0 && n == 0) returngrid[0][0];
if (m == 0) {
dp[m][n] = grid[m][n] + helper(grid, m, n - 1, dp);
returndp[m][n];
 }
if (n == 0) {
dp[m][n] = grid[m][n] + helper(grid, m - 1, n, dp);
returndp[m][n];
 }
if (dp[m][n] != -1) returndp[m][n];
dp[m][n] =
grid[m][n] +
Math.min(helper(grid, m, n - 1, dp), helper(grid, m - 1, n, dp));
returndp[m][n];
 }
}