forked from rajatgoyal715/Hackerrank
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathJavaAnagrams.java
More file actions
39 lines (36 loc) · 989 Bytes
/
JavaAnagrams.java
File metadata and controls
39 lines (36 loc) · 989 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
39
import java.io.*;
import java.util.*;
public class JavaAnagrams {
static boolean isAnagram(String a, String b) {
int s1[] = new int[26];
int s2[] = new int[26];
int l1 = a.length();
int l2 = b.length();
if (l1 != l2)
return false;
int n;
for (int i = 0; i < l1; i++) {
n = a.charAt(i) - 65;
if (n > 25)
n -= 32;
s1[n]++;
n = b.charAt(i) - 65;
if (n > 25)
n -= 32;
s2[n]++;
}
for (int i = 0; i < 26; i++) {
if (s1[i] != s2[i])
return false;
}
return true;
}
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");
}
}