提示
一、不同路径
1.确定dp数组以及下标含义,机器人只能向下或者向右移动,所以当前节点只能由左边和上边节点决定,所以dp[i][j] = dp[j-1][j]+dp[i][j-1]
class Solution {
public:
int uniquePaths(int m, int n) {
//1.确定dp数组及下标的含义
vector<vector<int>>dp(m, vector<int>(n, 0));
//2.确定递推公式
//dp[i][j] = dp[i-1][j] + dp[i][j-1];
//3.dp数组初始化
for (int i = 0; i < m; i++) dp[i][0] = 1;
for (int j = 0; j < n; j++) dp[0][j] = 1;
//4.遍历顺序
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];
}
}
//5.举例推导
return dp[m-1][n-1];
}
};
二、不同路径
思路与不同路径大致相同,只不过加了一个障碍,只需要将障碍所在节点dp数组置为0
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
//障碍所在地方dp需要为0
//1.确定dp数组及下标含义
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
vector<vector<int>>dp(m, vector<int>(n, 0));
//2.确定递推公式
//3.dp数组初始化
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;
//4.遍历顺序
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];
}
};
总结
思路和梯子问题大致相同
学习时间90min。
学习资料:《代码随想录》。