class Solution {
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int m = obstacleGrid.length;
int n = obstacleGrid[0].length;
if(obstacleGrid[0][0] == 1 || obstacleGrid[m - 1][n - 1] == 1) return 0;
if(m == 1 && n == 1) return 1;
boolean stop = true;
for(int i = 1;i < m;i++){
if(stop){
if(obstacleGrid[i][0] == 0) obstacleGrid[i][0] = 1;
else {
obstacleGrid[i][0] = 0;
stop = false;
}
}else obstacleGrid[i][0] = 0;
}
stop = true;
for(int i = 1;i < n;i++){
if(stop){
if(obstacleGrid[0][i] == 0) obstacleGrid[0][i] = 1;
else{
obstacleGrid[0][i] = 0;
stop = false;
}
}else obstacleGrid[0][i] = 0;
}
for(int i = 1;i < m;i++){
for(int j = 1;j < n;j++){
if(obstacleGrid[i][j] == 1) obstacleGrid[i][j] = 0;
else obstacleGrid[i][j] = obstacleGrid[i - 1][j] + obstacleGrid[i][j - 1];
}
}
return obstacleGrid[m - 1][n - 1];
}
}
在初始化第一行和第一列时,没遇到阻碍时,全部置1,遇到阻碍了,阻碍格及其后续全部置0,相当于此路不通。在动态规划时,遇到阻碍直接将当前格置0,其他不变,在最前面排除特殊情况,起点或者终点有障碍,直接返回0,如果m=n=1,直接返回1;