-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathJava Anagrams.java
More file actions
44 lines (37 loc) · 1.04 KB
/
Copy pathJava Anagrams.java
File metadata and controls
44 lines (37 loc) · 1.04 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
import java.util.Scanner;
public class Solution {
static boolean isAnagram(String a, String b)
{
if(a.length()!=b.length())
return false;
else
{
char[] a1 = a.toLowerCase().toCharArray();
char[] b1 = b.toLowerCase().toCharArray();
int count[] = new int[26];
int n = a1.length;
int m = b1.length;
if(n != m)
return false;
for(int i=0;i<n;i++)
{
count[a1[i]-97]++;
count[b1[i]-97]-- ;
}
for(int i=0;i<26;i++)
{
if (count[i] != 0)
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" );
}
}