-
-
Notifications
You must be signed in to change notification settings - Fork 608
/
Copy pathFindAllAnagramsinString.java
44 lines (35 loc) · 1.08 KB
/
FindAllAnagramsinString.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
41
42
43
44
package problems.easy;
import java.util.ArrayList;
import java.util.List;
/**
* Created by sherxon on 2016-12-28.
*/
public class FindAllAnagramsinString {
public static void main(String[] args) {
new FindAllAnagramsinString().findAnagrams("cbaebabacd", "abc");
}
public List<Integer> findAnagrams(String s, String p){
List<Integer> list= new ArrayList<>();
int[] a= new int[26];
if(s==null || s.length()==0 || p==null || p.length()==0)return list;
for (char c : p.toCharArray()) // count all frequencies of each character
a[c-'a']++;
int start=0;
int end=0;
int count=p.length();
while (end<s.length()){
if(a[s.charAt(end)-'a']>=1)count--;
a[s.charAt(end)-'a']--;
end++;
if(count==0)
list.add(start);
if(end-start==p.length()){
if(a[s.charAt(start)-'a']>=0)
count++;
a[s.charAt(start)-'a']++;
start++;
}
}
return list;
}
}