问题:
/**
* 给定一个包含非负整数的 m x n 网格,请找出一条从左上角到右下角的路径,使得路径上的数字总和为最小。
*
* 说明:每次只能向下或者向右移动一步。
*
* 示例:
*
* 输入:
* [
* [1,3,1],
* [1,5,1],
* [4,2,1]
* ]
* 输出: 7
* 解释: 因为路径 1→3→1→1→1 的总和最小。
*
*/
思路:
设置dp[][]数组,dp[i][j] :为第i行第j列的最小路径和。
当i== 0 时:dp[i][j] = dp[i][j-1]+grid[i][j];
当j == 0时:dp[i][j] = dp[i-1][j]+gird[i][j];
当i == 0 && j == 0 :dp[i][j] = grid[i][j];
都不为0时:dp[i][j] = min(dp[i][j-1],dp[i-1][j])+grid[i][j];
代码:
public class Test64 {
public static void main(String[] args) {
int[][] grid = {
{1,2},
{5,6},
{1,1}
};
System.out.println(minPathSum(grid));
}
public static int minPathSum(int[][] grid) {
if(grid.length == 0){
return 0;
}
int[][] dp = new int[grid.length][grid[0].length];
for(int i = 0;i < dp.length;i++) {
for(int j = 0; j < dp[i].length;j++) {
if(i == 0 && j != 0){
dp[i][j] = dp[i][j-1]+grid[i][j];
}else if(j == 0 && i != 0){
dp[i][j] = dp[i-1][j]+grid[i][j];
}else if(i == 0 && j == 0){
dp[i][j] = 0+grid[i][j];
}else {
dp[i][j] = Math.min(dp[i-1][j],dp[i][j-1])+grid[i][j];
}
}
}
return dp[grid.length-1][grid[0].length-1];
}
}