-
Notifications
You must be signed in to change notification settings - Fork 100
Expand file tree
/
Copy pathValidAnagram_242.java
More file actions
61 lines (56 loc) · 1.79 KB
/
Copy pathValidAnagram_242.java
File metadata and controls
61 lines (56 loc) · 1.79 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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
package LeetcodeFirstMonth;
import java.util.HashMap;
public class ValidAnagram_242 {
/*
* Runtime: 23 ms, faster than 22.84% of Java online submissions for Valid
* Anagram.
* Memory Usage: 46.2 MB, less than 23.74% of Java online submissions for Valid
* Anagram.
*/
public boolean isAnagram(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 Character = s.charAt(i);
if (map.containsKey(Character)) {
map.put(Character, map.get(Character) + 1);
} else {
map.put(Character, 1);
}
}
for (int j = 0; j < t.length(); j++) {
char charToCheck = t.charAt(j);
if (map.containsKey(charToCheck)) {
if (map.get(charToCheck) > 0) {
map.put(charToCheck, map.get(charToCheck) - 1);
} else {
return false;
}
} else {
return false;
}
}
return true;
}
// From Leetcode
public class Solution {
public boolean isAnagram(String s, String t) {
int[] alphabet = new int[26];
for (int i = 0; i < s.length(); i++)
alphabet[s.charAt(i) - 'a']++;
for (int i = 0; i < t.length(); i++) {
alphabet[t.charAt(i) - 'a']--;
if (alphabet[t.charAt(i) - 'a'] < 0)
return false;
}
for (int i : alphabet)
if (i != 0)
return false;
return true;
}
}
public static void main(String[] args) {
}
}