1.不同路径
1.1 题目
https://leetcode.cn/problems/unique-paths/description/
1.2 题解
class Solution
{
public:
//只能向下或者向右移动
int uniquePaths(int m, int n)
{
//定义dp数据,二维的,dp[i][j]表示从(0,0)出发到达(m,n)有几条路径
vector<vector<int>> dp(m, vector<int>(n, 0));
//确定递推规律
//dp[i][j]=dp[i-1][j]+dp[i][j-1];
//初始化
for (int i = 0; i < m; i++)dp[i][0] = 1;
for (int i = 0; i < n; i++)dp[0][i] = 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];
}
};
2.不同路径II
2.1 题目
2.2 题解
class Solution
{
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid)
{
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
//如果障碍物在起点或者终点
if (obstacleGrid[0][0] == 1 || obstacleGrid[m - 1][n - 1] == 1)return 0;
//定义dp数据,二维的,dp[i][j]表示从(0,0)出发到达(m,n)有几条路径
vector<vector<int>> dp(m, vector<int>(n, 0));
//确定递推规律
/*if (obstacleGrid[i][j] == 0)
{
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}*/
//初始化,有障碍物就跳过
for (int i = 0; i < m && obstacleGrid[i][0] == 0; i++)dp[i][0] = 1;
for (int i = 0; i < n && obstacleGrid[0][i] == 0; i++)dp[0][i] = 1;
//开始遍历,从左向右遍历
for (int i = 1; i < m; i++)
{
for (int j = 1; j < n; j++)
{
if (obstacleGrid[i][j] == 1)continue;
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp[m - 1][n - 1];
}
};