62.不同路径
62题目链接
dp[i] [j]的定义:到达第 i 行 第 j 列的路径数
递推公式:dp[i] [j] 通过dp[i - 1] [j] 和 dp[i] [j - 1] 得到
dp[i] [j] = dp[i - 1] [j] + dp[i] [j - 1];
dp数组的初始化:最上面一行,和最左面一行都为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];
}
};
63. 不同路径 II
63题目链接
本题与上题62 思路一致,只不过在 遇到障碍物时,赋值为0, 在开始初始化时,在最上面和最左面时,遇到即终止。
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
vector<vector<int>> dp(obstacleGrid.size(), vector<int>(obstacleGrid[0].size(), 0));
if (obstacleGrid[0][0] == 1 || obstacleGrid[obstacleGrid.size() - 1][obstacleGrid[0].size() - 1] == 1) return 0;
else dp[0][0] = 1;
for (int i = 0; i < obstacleGrid.size() && obstacleGrid[i][0] == 0; i++) {
dp[i][0] = 1;
}
for (int j = 0; j < obstacleGrid[0].size() && obstacleGrid[0][j] == 0; j++) {
dp[0][j] = 1;
}
for (int i = 1; i < obstacleGrid.size(); i++) {
for (int j = 1; j < obstacleGrid[0].size(); j++) {
if (obstacleGrid[i][j] == 0) {
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
}
return dp[obstacleGrid.size() - 1][obstacleGrid[0].size() - 1];
}
};