-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSherlokAndAnagrams.java
52 lines (36 loc) · 1.17 KB
/
SherlokAndAnagrams.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
45
46
47
48
49
package com.company;
import java.util.ArrayList;
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
String s1 = "abba";
System.out.println(sherlockAndAnagrams(s1));
}
static int sherlockAndAnagrams(String s) {
int result = 0;
ArrayList<String> substring = new ArrayList<>();
for (int i = 0; i < s.length(); i++) {
for (int j = i + 1; j <= s.length(); j++) {
substring.add(s.substring(i, j));
}
}
for (int i = 0; i < substring.size(); i++) {
for (int j = i + 1; j < substring.size(); j++) {
if (isAnagram(substring.get(i), substring.get(j))) {
result++;
}
}
}
return result;
}
public static boolean isAnagram(String a, String b) {
if (a.length() != b.length()) {
return false;
}
char[] lettersFromA = a.toCharArray();
Arrays.sort(lettersFromA);
char[] lettersFromB = b.toCharArray();
Arrays.sort(lettersFromB);
return Arrays.equals(lettersFromA, lettersFromB);
}
}