-
-
Notifications
You must be signed in to change notification settings - Fork 167
/
Copy pathValidAnagram.java
72 lines (57 loc) · 1.91 KB
/
ValidAnagram.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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
package java1.algorithms.strings;
import java.util.HashMap;
public class ValidAnagram {
//HashMap:- TC:O(n) SC:O(n)
private static boolean validAnagram1(String str1, String str2) {
if(str1.length() != str2.length()) {
return false;
}
HashMap<Character, Integer> hashMap = new HashMap<>();
for(int i = 0; i< str1.length(); i++) {
char ch = str1.charAt(i);
hashMap.put(ch, hashMap.getOrDefault(ch, 0) + 1);
}
for(int j=0; j< str2.length(); j++) {
char ch = str2.charAt(j);
if(hashMap.containsKey(ch)) {
if(hashMap.get(ch) == 1) {
hashMap.remove(ch);
} else if(hashMap.get(ch) > 1) {
hashMap.put(ch, hashMap.get(ch)-1);
}
} else {
return false;
}
}
if(hashMap.size() == 0) {
return true;
} else {
return false;
}
}
//Using Array: TC:O(n) SC:O(1)
private static boolean validAnagram2(String str1, String str2) {
if(str1.length() != str2.length()) return false;
int[] chars = new int[26];
for(int i=0; i< str1.length(); i++) {
char ch1 = str1.charAt(i);
char ch2 = str2.charAt(i);
chars[ch1 - 'a']++;
chars[ch2 - 'a']--;
}
for(int ch: chars) {
if(ch !=0) return false;
}
return true;
}
public static void main(String[] args) {
String s1 = "anagram", s2="nagaram";
System.out.println(validAnagram1(s1, s2));
String t1 = "cat", t2="rat";
System.out.println(validAnagram1(t1, t2));
String a1 = "anagram", a2="nagaram";
System.out.println(validAnagram2(a1, a2));
String b1 = "cat", b2="rat";
System.out.println(validAnagram1(b1, b2));
}
}