-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathjava-anagrams.java
More file actions
38 lines (30 loc) · 995 Bytes
/
java-anagrams.java
File metadata and controls
38 lines (30 loc) · 995 Bytes
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
import java.util.Scanner;
public class Solution {
static boolean isAnagram(String a, String b) {
if (a.length() != b.length()) {
return false;
}
// Complete the function
int[] frequencyA = new int[26];
int[] frequencyB = new int[26];
for (int i = 0; i < a.length(); i++) {
frequencyA[Character.toLowerCase(a.charAt(i)) - 'a']++;
frequencyB[Character.toLowerCase(b.charAt(i)) - 'a']++;
}
boolean isAnagram = true;
for (int i = 0; i < 26; i++) {
if (frequencyA[i] != frequencyB[i]) {
isAnagram = false;
}
}
return isAnagram;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String a = scan.next();
String b = scan.next();
scan.close();
boolean ret = isAnagram(a, b);
System.out.println((ret) ? "Anagrams" : "Not Anagrams");
}
}