目录
一、不同路径题目
二、代码
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>>dp(m+1,vector<int>(n+1,1));//直接全部初始化为1
if(m==1&&n==2)
return dp[1][2];
if(m==2&&n==1)
return dp[2][1];
for(int i=2;i<=m;i++)
{
for(int j=2;j<=n;j++)
{
dp[i][j]=dp[i-1][j]+dp[i][j-1];
}
}
return dp[m][n];
}
};
三、不同路径2题目
四、代码
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid)
{
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
vector<vector<int>>dp(m + 1, vector<int>(n + 1, 0));//直接全部初始化为0
if (m == 1 && n == 1)
{
if (obstacleGrid[0][0] == 0)
dp[1][1] = 1;
return dp[1][1];
}
if (m == 1 && n == 2)
{
if (obstacleGrid[0][0] == 0 && obstacleGrid[0][1] == 0)
dp[1][2] = 1;
return dp[1][2];
}
if (m == 2 && n == 1)
{
if (obstacleGrid[0][0] == 0 && obstacleGrid[1][0] == 0)
dp[2][1] = 1;
return dp[2][1];
}
for (int i = 1; i <= m; i++)//初始化第一列,只要遇见一个障碍物,后面dp全部为0
{
if (obstacleGrid[i - 1][0] == 0)
dp[i][1] = 1;
else
break;
}
for (int j = 1; j <= n; j++)//初始化第一行,与上述同理
{
if (obstacleGrid[0][j - 1] == 0)
dp[1][j] = 1;
else
break;
}
for (int i = 2; i <= m; i++)
{
for (int j = 2; j <= n; j++)
{
if (obstacleGrid[i - 1][j - 1] == 0)
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp[m][n];
}
};