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.
Example
Input:
[[1,3,1],[1,5,1],[4,2,1]]
Output:
7
Notice
You can only move either down or right at any point in time.
public class Solution {
/**
* @param grid: a list of lists of integers
* @return: An integer, minimizes the sum of all numbers along its path
*/
public int minPathSum(int[][] grid) {
if(grid == null || grid.length <= 0) return 0;
int res = Integer.MAX_VALUE;
int m = grid.length, n = grid[0].length;
int[][] dp = new int[m][n];
dp[0][0] = grid[0][0];
for(int i = 1; i < n; i++) {
dp[0][i] = grid[0][i] + dp[0][i-1];
}
for(int i = 1; i < m; i++) {
dp[i][0] = grid[i][0] + dp[i-1][0];
}
for(int i = 1; i < m; i++) {
for(int j = 1; j < n; j++) {
if(i == 0 || j == 0) {
continue;
}
dp[i][j] = Math.min(dp[i-1][j], dp[i][j-1]) + grid[i][j];
}
}
return dp[m-1][n-1];
}
}