class Solution {
public:
int minPathSum(vector<vector<int>>& grid)
{
int m = grid.size();
int n = grid[0].size();
int dp[m][n];
for(int i = 0; i < m; ++i)
{
for(int j = 0; j < n; ++j)
{
if(i == 0 && j == 0)
dp[i][j] = grid[0][0]; //i=0,j=0
else if(i == 0)
dp[i][j] = dp[i][j - 1] + grid[i][j]; //i=0
else if(j == 0)
dp[i][j] = dp[i - 1][j] + grid[i][j]; //j=0
else
dp[i][j] = min(dp[i - 1][j], dp[i][j -1]) + grid[i][j]; //i>0,j>0
}
}
return dp[m - 1][n - 1];
}
};
leetcode64. 最小路径和
最新推荐文章于 2024-07-10 11:20:40 发布