-
Notifications
You must be signed in to change notification settings - Fork 62
/
Solution.java
40 lines (38 loc) · 1.3 KB
/
Solution.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
40
package g0001_0100.s0063_unique_paths_ii;
// #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_15
// #2023_08_11_Time_0_ms_(100.00%)_Space_40.6_MB_(73.18%)
public class Solution {
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
// if start point has obstacle, there's no path
if (obstacleGrid[0][0] == 1) {
return 0;
}
obstacleGrid[0][0] = 1;
int m = obstacleGrid.length;
int n = obstacleGrid[0].length;
for (int i = 1; i < m; i++) {
if (obstacleGrid[i][0] == 1) {
obstacleGrid[i][0] = 0;
} else {
obstacleGrid[i][0] = obstacleGrid[i - 1][0];
}
}
for (int j = 1; j < n; j++) {
if (obstacleGrid[0][j] == 1) {
obstacleGrid[0][j] = 0;
} else {
obstacleGrid[0][j] = obstacleGrid[0][j - 1];
}
}
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];
}
}