62. 不同路径
笔记
class Solution {
public:
int uniquePaths(int m, int n) {
/*
vector<vector<int>> dp(m, vector<int>(n));
for (int i = 0; i < n; i++) {
dp[0][i] = 1;
}
for (int i = 0; i < m; i++) {
dp[i][0] = 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];
*/
vector<int> dp(n, 1);
for (int i = 1; i < m; i++) {
for (int i = 1; i < n; i++) {
dp[i] = dp[i] + dp[i - 1];
}
}
return dp[n - 1];
}
};
63. 不同路径 II
笔记
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
vector<vector<int>> dp(obstacleGrid);
int flag = 0;
for (int i = 0; i < dp[0].size(); i++) {
if (obstacleGrid[0][i] != 1 && flag != 1) {
dp[0][i] = 1;
}
else {
flag = 1;
dp[0][i] = 0;
}
}
flag = 0;
for (int i = 0; i < dp.size(); i++) {
if (obstacleGrid[i][0] != 1 && flag != 1) {
dp[i][0] = 1;
}
else {
flag = 1;
dp[i][0] = 0;
}
}
for (int i = 1; i < dp.size(); i++) {
for (int j = 1; j < dp[0].size(); j++) {
if (obstacleGrid[i][j] == 1) dp[i][j] = 0;
else
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp.back().back();
}
};