LeetCode62.不同路径
思路:
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>> dp(m, vector<int>(n, 0));//dp数组含义表示到达该点有多少种方法
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];
}
};
LeetCode63.不同路径II
题目链接:63. 不同路径 II - 力扣(LeetCode)
思路:
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m = obstacleGrid.size();//m * n的数组的m和n取出
int n = obstacleGrid[0].size();
if(obstacleGrid[m - 1][n - 1] == 1 || obstacleGrid[0][0] == 1) return 0;//如果初始就堵住返回0
vector<vector<int>> dp(m, vector<int>(n, 0));//dp[i][j]表示不同路径有多少
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] == 0) dp[i][j] = dp[i - 1][j] + dp[i][j - 1];//没堵住就有多少种方法
else continue;
}
}
return dp[m - 1][n - 1];
}
};