242. Valid Anagram
class Solution:
def isAnagram(self, s: str, t: str) -> bool:
table = defaultdict(int)
for char in s:
table[char] += 1
for char in t:
if table[char] > 0:
table[char] -= 1
else:
return False
for key in table.keys():
if table[key] != 0:
return False
return Trueclass Solution {
public boolean isAnagram(String s, String t) {
final Map<String, Integer> map = new HashMap();
for (final String c : s.split("")) {
map.put(c, map.getOrDefault(c, 0) + 1);
}
for (final String d : t.split("")) {
if (map.containsKey(d)) {
map.put(d, map.get(d) - 1);
} else {
return false;
}
}
for (final Map.Entry<String, Integer> entry : map.entrySet()) {
if (entry.getValue() != 0) {
return false;
}
}
return true;
}
}Last updated