这道题,最重要的在于初始化行,初始化列。并且初始化也带着在动态规划,不过初始化是简单的递推。cpp中二维数组的行=nums.size()。列=nums[0].size()。
class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int m = grid.size();
int n = grid[0].size();
int dp[m+1][n+1];
dp[0][0] = grid[0][0];
for (int i = 1; i < m; i++) {
dp[i][0] = dp[i - 1][0] + grid[i][0];
}
for (int j = 1; j < n; j++) {
dp[0][j] = dp[0][j - 1] + grid[0][j];
}
for(int i=1;i<m;++i){
for(int j=1;j<n;++j){
dp[i][j] = min(dp[i-1][j]+grid[i][j],dp[i][j-1]+grid[i][j]);
}
}
return dp[m-1][n-1];
}
};