-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathleetcode63.java
More file actions
38 lines (37 loc) · 1.08 KB
/
Copy pathleetcode63.java
File metadata and controls
38 lines (37 loc) · 1.08 KB
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
package leetcode;
/*
* 递归，遇见1返回0
* */
public class leetcode63 {
public static void main(String[] args) {
System.out.println(
new leetcode63().uniquePathsWithObstacles(new int[][]{
{0,0,0},
{0,1,0},
{0,0,0},
{0,0,0}
})
);
}
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
return find(obstacleGrid,0,0);
}
public int find(int[][] obstacleGrid,int y,int x){
if (obstacleGrid[y][x]==1){ //这条路走不通
return 0;
}
if (y==obstacleGrid.length-1&&x==obstacleGrid[0].length-1){
return 1;
}
if (y+1<obstacleGrid.length&&x+1<obstacleGrid[0].length){
return find(obstacleGrid,y+1,x)+find(obstacleGrid,y,x+1);
}
if (y+1<obstacleGrid.length){
return find(obstacleGrid,y+1,x);
}
if (x+1<obstacleGrid.length){
return find(obstacleGrid,y,x+1);
}
return 0;
}
}