一、题目描述
二、分析过程
三、代码
class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int m = grid.size();
int n = grid[0].size();
vector<vector<int>> dp(m, vector<int>(n, 0));
dp[0][0] = grid[0][0];
//初始化dp
for(int i = 1; i < m; i++) dp[i][0] = grid[i][0] + dp[i - 1][0];
for(int j = 1; j < n; j++) dp[0][j] = grid[0][j] + dp[0][j - 1];
for(int i = 1; i < m; ++i)
{
for(int j = 1; j < n; ++j)
{
dp[i][j] = min(grid[i][j] + dp[i][j - 1], grid[i][j] + dp[i - 1][j]);
}
}
return dp[m - 1][n - 1];
}
};
时间复杂度:O(m * n)
空间复杂度:O(m * n)