62.不同路径
题目链接:62.不同路径
文章讲解:代码随想录|62.不同路径
思路
1.确定dp数组(dp table)以及下标的含义:dp[x][y]到达(x,y)存在的路径数量
2.确定递推公式:dp[x][y] = dp[x-1][y] + dp[x][y-1]
3.dp数组如何初始化:dp[1][j] = 1; dp[i][1] = 1;
4.确定遍历顺序:x++;y++
5.举例推导dp数组
代码
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>> dp(m + 1, vector<int>(n + 1,0));
for(int i = 1; i <= m; i++)dp[i][1] = 1;
for(int j = 1; j <= n; j++)dp[1][j] = 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];
}
};
63. 不同路径 II
题目链接:63. 不同路径 II
文章讲解:代码随想录|63. 不同路径 II
思路
相比于上一题,就多了个判断该点是否为障碍点,如果是障碍点就保持初始值0不变,不参与状态转移。
代码
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
if (obstacleGrid[m - 1][n - 1] == 1 || obstacleGrid[0][0] == 1) //如果在起点或终点出现了障碍,直接返回0
return 0;
vector<vector<int>> dp(m, vector<int>(n, 0));
for (int i = 0; i < m && obstacleGrid[i][0] == 0; i++) dp[i][0] = 1;
for (int j = 0; j < n && obstacleGrid[0][j] == 0; j++) dp[0][j] = 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];
}
};