day28打卡
62 不同路径
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector
if(m <= 1)
{
return m;
}
if(n <= 1)
{
return n;
}
for(int i = 0; i < n; ++i)
{
dp[0][i] = 1;
}
for(int j = 0; j < m; ++j)
{
dp[j][0] = 1;
}
for(int i = 1; i < m; ++i)
{
for(int j = 1; j < n; ++j)
{
dp[i][j] = dp[i-1][j] + dp[i][j-1];
}
}
return dp[m-1][n-1];
}
};
不同路径II
class Solution {
public:
int uniquePathsWithObstacles(vector<vector
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
vector<vector
if (obstacleGrid[m][n] == 1 || obstacleGrid[1][1] == 1)
return 0;
for(int j = 1; j <= n && obstacleGrid[1][j] == 0; ++j)
{
dp[1][j] = 1;
}
for(int i = 1; i <= m && obstacleGrid[i][1] == 0; ++i)
{
dp[i][1] = 1;
}
for(int i = 2; i <= m; ++i)
{
for(int j = 2; j <= n; ++j)
{
if(obstacleGrid[i][j] != 1)
{
dp[i][j] = dp[i-1][j] + dp[i][j-1];
}
}
}
return dp[m][n];
}
};
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步