-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
71 lines (65 loc) · 2.31 KB
/
Copy pathSolution.java
File metadata and controls
71 lines (65 loc) · 2.31 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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
package leetcode._79_;
class Solution {
public boolean exist(char[][] board, String word) {
if (board == null || board.length == 0) {
return false;
}
int rows = board.length;
int width = board[0].length;
int[][] occupied = new int[rows][width];
char[] chars = word.toCharArray();
char firstChar = chars[0];
for (int i = 0; i < rows; i++) {
for (int j = 0; j < width; j++) {
if (board[i][j] == firstChar) {
occupied[i][j] = 1;
if (existSubStr(board, occupied, chars, 1, i, j)) {
return true;
} else {
occupied[i][j] = 0;
}
}
}
}
return false;
}
private boolean existSubStr(char[][] board, int[][] occupied, char[] chars, int startIndex, int i, int j) {
if (startIndex >= chars.length) {
return true;
}
char aChar = chars[startIndex];
if (i + 1 < board.length && board[i + 1][j] == aChar && occupied[i + 1][j] == 0) {
occupied[i + 1][j] = 1;
if (existSubStr(board, occupied, chars, startIndex + 1, i + 1, j)) {
return true;
} else {
occupied[i + 1][j] = 0;
}
}
if (i - 1 >= 0 && board[i - 1][j] == aChar && occupied[i - 1][j] == 0) {
occupied[i - 1][j] = 1;
if (existSubStr(board, occupied, chars, startIndex + 1, i - 1, j)) {
return true;
} else {
occupied[i - 1][j] = 0;
}
}
if (j + 1 < board[0].length && board[i][j + 1] == aChar && occupied[i][j + 1] == 0) {
occupied[i][j + 1] = 1;
if (existSubStr(board, occupied, chars, startIndex + 1, i, j + 1)) {
return true;
} else {
occupied[i][j + 1] = 0;
}
}
if (j - 1 >= 0 && board[i][j - 1] == aChar && occupied[i][j - 1] == 0) {
occupied[i][j - 1] = 1;
if (existSubStr(board, occupied, chars, startIndex + 1, i, j - 1)) {
return true;
} else {
occupied[i][j - 1] = 0;
}
}
return false;
}
}