代码随想录算法打卡第三十四天, 新手自我记录一下刷题历程, 仅为自我打卡使用.
写的有点生涩, 不太利落
62. 不同路径
class Solution {
public:
int uniquePaths(int m, int n) {
int dp[m][n];
dp[0][0] = 1;
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
if (i == 0 && j == 0) continue;
dp[i][j] = 0;
if (i - 1 >= 0) {
dp[i][j] += dp[i - 1][j];
}
if (j - 1 >= 0) {
dp[i][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();
if (obstacleGrid[m - 1][n - 1] == 1) {
return 0;
}
int dp[m][n];
dp[0][0] = 1;
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
if (i == 0 && j == 0) {
if (obstacleGrid[i][j] == 1) return 0;
else continue;
}
dp[i][j] = 0;
if (obstacleGrid[i][j] != 1) {
if (i - 1 >= 0) {
dp[i][j] += dp[i - 1][j];
}
if (j - 1 >= 0) {
dp[i][j] += dp[i][j - 1];
}
}
}
}
return dp[m - 1][n - 1];
}
};
希望还能再坚持一天!