62. 不同路径
我自己写出来的!本节点等于左节点加上节点,最上一排初始化为1,最左一排初始化为1,就可以按照每行从上到下,每列从左到右的方法,填满整个二维dp表。返回结果即为dp[m-1][n-1],即右下角数值。
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>> dp(m, vector<int>(n));
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 = 0;i<m;i++) {
// for (int j = n; j<n; j++) {
// cout<<dp[i][j]<<" ";
// }
// cout<<endl;
// }
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
这题也是我自己写出来的!我的想法是障碍物点就在dp中表示为-1,不可达点(被障碍物挡住路径)dp也表示为-1,在填dp的时候如果遇到该点为障碍物,就标记为-1,如果左和上都不可达也标记为-1,否则左和上非负点值相加。
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
// 我写的代码,把不能到达或者有障碍物的dp点设置为-1
vector<vector<int>> dp(obstacleGrid.size(),vector<int>(obstacleGrid[0].size()));
for (int i = 0; i<obstacleGrid.size(); i++) {
if (obstacleGrid[i][0] == 1){
while (i < obstacleGrid.size()){
dp[i][0] = -1;
i++;
}
break;
}
else {
dp[i][0] = 1;
}
}
for (int j = 0; j<obstacleGrid[0].size(); j++) {
if (obstacleGrid[0][j] == 1) {
while (j < obstacleGrid[0].size()){
dp[0][j] = -1;
j++;
}
break;
}
else {
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] == 1) {
dp[i][j] = -1;
}
else if (dp[i-1][j] > 0 && dp[i][j-1] > 0) {
dp[i][j] = dp[i-1][j] + dp[i][j-1];
}
else if (dp[i-1][j] > 0 && dp[i][j-1] < 0){
dp[i][j] = dp[i-1][j];
}
else if (dp[i][j-1] > 0 && dp[i-1][j] < 0) {
dp[i][j] = dp[i][j-1];
}
else if (dp[i-1][j] <0 && dp[i][j-1] < 0) {
dp[i][j] = -1;
}
}
}
if (obstacleGrid[0][0] == 1) {
return 0;
}
if (dp[obstacleGrid.size()-1][obstacleGrid[0].size()-1] == -1) {
return 0;
}
else
return dp[obstacleGrid.size()-1][obstacleGrid[0].size()-1];
}
};
代码随想录的方法是dp全部初始化为0,如果障碍物或者不可达不变,否则第一行和第一列初始化为1。填表过程中遇到障碍物就跳过,否则左和上数值相加。这巧妙地运用了障碍物或不可达点数值为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];
}
};