# LeetCode-63. Unique Paths II

Now consider if some obstacles are added to the grids. How many unique paths would there be?

An obstacle and empty space is marked as 1 and 0 respectively in the grid.

For example,

There is one obstacle in the middle of a 3x3 grid as illustrated below.

[
[0,0,0],
[0,1,0],
[0,0,0]
]


The total number of unique paths is 2.

Note: m and n will be at most 100.

public class Solution {
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
if(obstacleGrid[0][0] == 1){
return 0;
}
boolean flag = false;
int m = obstacleGrid.length;
int n = obstacleGrid[0].length;
for(int i = 0; i < m; i++){
if(flag == false){
if(obstacleGrid[i][0] == 0){
obstacleGrid[i][0] = 1;
}else{
obstacleGrid[i][0] = 0;
flag = true;
}
}else{
obstacleGrid[i][0] = 0;
}
}
flag = false;
for(int i = 1; i < n; i++){
if(flag == false){
if(obstacleGrid[0][i] == 0){
obstacleGrid[0][i] = 1;
}else{
obstacleGrid[0][i] = 0;
flag = true;
}
}else{
obstacleGrid[0][i] = 0;
}
}
for(int i = 1; i < m; i++){
for(int j = 1; j < n; j++){
if(obstacleGrid[i][j] == 0){
obstacleGrid[i][j] = obstacleGrid[i-1][j] + obstacleGrid[i][j-1];
}else{
obstacleGrid[i][j] = 0;
}
}
}
return obstacleGrid[m-1][n-1];

}
}

• 本文已收录于以下专栏：

举报原因： 您举报文章：LeetCode-63. Unique Paths II 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)