class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
if (obstacleGrid[0][0] == 1)
return 0;
int m = obstacleGrid.size();
int n = obstacleGrid[0].size();
vector<vector<int>> dp(m, vector<int>(n));
dp[0][0] = 1;
int flag = 1;
for (int i = 1; i < m; i++) {
//还未碰到障碍物
if (flag == 1) {
//当前格子有障碍物
if (obstacleGrid[i][0] == 1) {
dp[i][0] = 0;
flag = 0;
}
else
dp[i][0] = 1;
}
else
dp[i][0] = 0;
}
flag = 1;
for (int j = 1; j < n; j++) {
//还未碰到障碍物
if (flag == 1) {
//当前格子有障碍物
if (obstacleGrid[0][j] == 1) {
dp[0][j] = 0;
flag = 0;
}
else
dp[0][j] = 1;
}
else
dp[0][j] = 0;
}
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
if(obstacleGrid[i][j] == 1)
dp[i][j] = 0;
else
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp[m - 1][n - 1];
}
};
06-23
788
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
06-16
428
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)