-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathanagram.java
35 lines (32 loc) · 916 Bytes
/
anagram.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
package Hashing;
import java.util.*;
public class anagram {
public static boolean validAnagram(String s, String t){
if(s.length()!=t.length()){
return false;
}
HashMap<Character, Integer>map=new HashMap<>();
for(int i=0;i<s.length();i++){
char ch=s.charAt(i);
map.put(ch,map.getOrDefault(ch,0)+1);
}
for(int i=0;i<t.length();i++){
char ch=t.charAt(i);
if(map.get(ch)!=null){
if(map.get(ch)==1){
map.remove(ch);
}else{
map.put(ch, map.get(ch)-1);
}
}else{
return false;
}
}
return map.isEmpty();
}
public static void main(String[] args) {
String s="race";
String t="care";
System.out.println(validAnagram(s, t));
}
}