方法:动态规划
①确定状态:dp[i][j]表示到grid[i][j]路径上的最小数字总和;
②转移方程:dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
③初始条件和边界情况:dp[0][0] = grid[0][0];
④计算顺序:因为dp[i][j] 由dp[i - 1][j]和dp[i][j - 1]推出,所以从小到大遍历。
class Solution {
public int minPathSum(int[][] grid) {
int m = grid.length;
int n = grid[0].length;
//dp[i][j]表示到grid[i][j]路径上的最小数字总和
int[][] dp = new int[m][n];
dp[0][0] = grid[0][0];//初始化
//第一行
for (int i = 1; i < n; i++) {
dp[0][i] = dp[0][i - 1] + grid[0][i];
}
//第一列
for (int i = 1; i < m; i++) {
dp[i][0] = dp[i - 1][0] + grid[i][0];
}
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
}
}
return dp[m - 1][n - 1];
}
}