-
Notifications
You must be signed in to change notification settings - Fork 0
/
Find the string in grid
86 lines (53 loc) · 1.79 KB
/
Find the string in grid
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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
//User function Template for Java
class Solution
{
public int[][] searchWord(char[][] grid, String word)
{
// Code here\\
int n = grid.length;
int m = grid[0].length;
List<int[]> ansList = new ArrayList<>();
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(grid[i][j]==word.charAt(0))
{
if(dfs(i,j,n,m,grid,word))
{
ansList.add(new int[]{i,j});
}
}
}
}
int[][] ans = new int[ansList.size()][2];
for(int i=0;i<ansList.size();i++)
{
ans[i]=ansList.get(i);
}
return ans;
}
int[] dx = {-1,-1,-1,0,1,1,1,0};
int[] dy = {-1,0, 1, 1, 1, 0, -1, -1};
boolean dfs(int x, int y, int n, int m, char[][] grid, String word)
{
for(int i=0;i<8;i++)
{
int lx = x+dx[i]*(word.length()-1);
int ly = y+dy[i]*(word.length()-1);
if(lx<0 || lx>=n || ly<0 || ly>=m)
continue;
int j;
for(j=0;j<word.length();j++)
{
int nx = x+dx[i]*j;
int ny = y+dy[i]*j;
if(grid[nx][ny]!=word.charAt(j))
break;
}
if(j==word.length())
return true;
}
return false;
}
}