63. Unique Paths II

Follow up for "Unique Paths":

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.

Subscribe to see which companies asked this question

public class Solution {
public int uniquePathsWithObstacles(int[][] o) {
int [][] list = new int [o.length][o[0].length];//第一列
for(int i = 0;i<o.length;i++){
if(o[i][0]==1)break;
list[i][0]=1;
}
for(int i = 0;i<o[0].length;i++){
if(o[0][i]==1)break;
list[0][i]=1;
}
for(int i = 1;i<o.length;i++){
for(int j = 1;j<o[0].length;j++){
if(o[i][j]==1)continue;
list[i][j]=list[i-1][j]+list[i][j-1];
}
}
return list[o.length-1][o[0].length-1];
}
}