- 最小路径和
给定一个包含非负整数的 m x n 网格 grid ,请找出一条从左上角到右下角的路径,使得路径上的数字总和为最小。
说明:每次只能向下或者向右移动一步。
class Solution {
public:
/*
dp[i][j] = grid[i][j] + min(dp[i][j-1], dp[i-1][j])
*/
int minPathSum(vector<vector<int>>& grid) {
int m = grid.size();
if (m == 0) {
return 0;
}
int n = grid[0].size();
if(n == 0) {
return 0;
}
int dp[m+1][n+1];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
dp[i][j] = grid[i][j];
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (i - 1 < 0 && j - 1 < 0) {
dp[i][j] = grid[i][j];
continue;
}
if (i - 1 < 0) {
dp[i][j] = grid[i][j] + dp[i][j-1];
} else if (j - 1 < 0) {
dp[i][j] = grid[i][j] + dp[i-1][j];
} else {
dp[i][j] = grid[i][j] + min(dp[i][j-1], dp[i-1][j]);
}
}
}
return dp[m-1][n-1];
}
};