代码随想录第39天

最新推荐文章于 2024-09-24 08:39:28 发布

气氛组阿宇

最新推荐文章于 2024-09-24 08:39:28 发布

阅读量109

点赞数

文章标签： leetcode 算法动态规划

本文链接：https://blog.csdn.net/Bi11y/article/details/129228116

版权

代码随想录第39天

62. 不同路径

class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>> dp(m,vector<int>(n,0));
dp[0][0] = 1;
for(int i =1; i < m;i++){
dp[i][0] = 1;
}
for(int i =1; i < n;i++){
dp[0][i] = 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

class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
vector<vector<int>> dp(m,vector<int>(n,0));

// //chushihua
// for(int i = 0; i < m; i++)
// {
//     dp[i][0] =1;
// }
// for(int i = 0; i < n; i++)
// {
//     dp[0][i] =1;
// }

//obs
dp[0][0] = 1;
if(obstacleGrid[0][0] == 1) return 0;
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
if(obstacleGrid[i][j] == 1){
dp[i][j] = 0;
}else{
if(i == 0 && j > 0){
dp[i][j] = dp[i][j-1];
}
if(j == 0 && i > 0){
dp[i][j] = dp[i-1][j];
}

if(i > 0 && j >0){
dp[i][j] = dp[i-1][j] + dp[i][j-1];
}
}
}
}
return dp[m-1][n-1];
}
};

这个麻烦了标准的方法

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];
}
};