-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
61 lines (51 loc) · 1.64 KB
/
Solution.java
File metadata and controls
61 lines (51 loc) · 1.64 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
public class Solution {
public List<Integer> findAnagrams(String s, String p) {
List<Integer> result = new ArrayList<Integer>();
Set<Character> charSet = new HashSet<Character>();
for (int i = 0; i < p.length(); i++)
charSet.add(p.charAt(i));
int i = 0;
while (i < s.length()) {
int[] map = getMap(p);
boolean matched = false;
int cnt = 0;
int j = i;
for (; j < s.length(); j++) {
if (map[s.charAt(j) - 'a'] > 0) {
map[s.charAt(j) - 'a']--;
cnt++;
if (cnt == p.length()) {
result.add(i);
matched = true;
break;
}
} else if (cnt < p.length()) {
break;
}
}
if (matched) {
i++;
} else if (j < s.length() && charSet.contains(s.charAt(j))) {
i++;
} else {
if (i == j) {
if (charSet.contains(s.charAt(j)))
i = j;
else
i = j + 1;
}
else {
i = j;
}
}
}
return result;
}
private int[] getMap(String p) {
int[] map = new int[26];
for (int i = 0; i < p.length(); i++) {
map[p.charAt(i) - 'a']++;
}
return map;
}
}