forked from prakashshuklahub/Interview-Questions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
63 Unique Paths II
41 lines (31 loc) · 1.03 KB
/
63 Unique Paths II
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
Now consider if some obstacles are added to the grids. How many unique paths would there be?
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int m = obstacleGrid.length;
int n = obstacleGrid[0].length;
if(obstacleGrid[0][0]==1)return 0;
int[][] dp = new int[m][n];
for(int i=0;i<dp[0].length;i++){
if(obstacleGrid[0][i]==0){
dp[0][i] = 1;
}else{
break;
}
}
for(int i=0;i<dp.length;i++){
if(obstacleGrid[i][0]==0){
dp[i][0] = 1;
}else{
break;
}
}
for(int i=1;i<dp.length;i++){
for(int j=1;j<dp[0].length;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];
}