代码随想录算法训练营第三十九天 | 62.不同路径,63. 不同路径 II
1.1 62.不同路径
思路:
- dp[i] [j] :表示从(0 ,0)出发,到(i, j) 有dp[i][j]条不同的路径
- dp[i] [j] = dp[i-1] [j] + dp[i] [j-1]
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>> dp(m, vector<int>(n, 0));
for (int i = 0; i < m; i++) dp[i][0] = 1;
for (int j = 0; j < n; j++) dp[0][j] = 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];
}
};
- 时间复杂度:O(m × n)
- 空间复杂度:O(m × n)
1.2 63. 不同路径 II
思路:
- dp[i] [j] :表示从(0 ,0)出发,到(i, j) 有dp[i][j]条不同的路径
- dp[i] [j] = dp[i-1] [j] + dp[i] [j-1]
- 因为有了障碍,(i, j)如果就是障碍的话应该就保持初始状态(初始状态为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];
}
};
- 时间复杂度:O(n × m),n、m 分别为obstacleGrid 长度和宽度
- 空间复杂度:O(n × m)