-
Notifications
You must be signed in to change notification settings - Fork 1
/
UniquePathII.java
39 lines (39 loc) · 1019 Bytes
/
UniquePathII.java
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
/**
* 63. Unique Path II
* @author LBW
*/
public class UniquePathII {
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int m = obstacleGrid.length, n = obstacleGrid[0].length;
int[][] dp = new int[m][n];
int idx = 0;
while (idx < n && obstacleGrid[0][idx] != 1) {
dp[0][idx] = 1;
idx += 1;
}
while (idx < n) {
dp[0][idx] = 0;
idx += 1;
}
idx = 0;
while (idx < m && obstacleGrid[idx][0] != 1) {
dp[idx][0] = 1;
idx += 1;
}
while (idx < m) {
dp[idx][0] = 0;
idx += 1;
}
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];
}
}