-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathJava_Anagrams.java
More file actions
39 lines (30 loc) · 1.05 KB
/
Copy pathJava_Anagrams.java
File metadata and controls
39 lines (30 loc) · 1.05 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
package com.Java.S2_Strings;
import java.util.*;
public class Java_Anagrams {
static boolean isAnagram(String a, String b) {
// Complete the function
HashMap<Character,Integer> occurenceA = new HashMap<>();
HashMap<Character,Integer> occurenceB = new HashMap<>();
for(char c : a.toLowerCase().toCharArray()){
if(occurenceA.containsKey(c))
occurenceA.put(c,occurenceA.get(c)+1);
else
occurenceA.put(c,1);
}
for(char c : b.toLowerCase().toCharArray()) {
if (occurenceB.containsKey(c))
occurenceB.put(c, occurenceB.get(c) + 1);
else
occurenceB.put(c, 1);
}
return occurenceA.equals(occurenceB);
}
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" );
}
}