主页有其他数据结构内容(持续更新中)
难度:Medium
代码:
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
// 如果在起点或终点出现了障碍,直接返回0
if (obstacleGrid[m - 1][n - 1] == 1 || obstacleGrid[0][0] == 1) {
return 0;
}
vector<vector<int>> dp(m, vector<int>(n, 0));
for(int i = 0; i < m && !obstacleGrid[i][0]; i++) {
dp[i][0] = 1;
}
for(int j = 0; j < n && !obstacleGrid[0][j]; j++) {
dp[0][j] = 1;
}
for(int i = 1; i < m; i++) {
for(int j = 1; j < n; j++) {
if(obstacleGrid[i][j]) {
continue;
}
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp[m - 1][n - 1];
}
};