-
Notifications
You must be signed in to change notification settings - Fork 0
/
242-valid_anagram.py
54 lines (35 loc) · 1.05 KB
/
242-valid_anagram.py
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
"""
https://leetcode.com/problems/valid-anagram/
Given two strings s and t, return true if t is an anagram of s,
and false otherwise.
An Anagram is a word or phrase formed by rearranging the letters
of a different word or phrase, typically using all the original
letters exactly once.
Example 1:
Input: s = "anagram", t = "nagaram"
Output: true
Example 2:
Input: s = "rat", t = "car"
Output: false
Constraints:
1 <= s.length, t.length <= 5 * 10^4
s and t consist of lowercase English letters.
Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?
"""
from collections import defaultdict
def isAnagram(s: str, t: str) -> bool:
if len(s) != len(t):
return False
sCounts = defaultdict(int)
for char in s:
sCounts[char] += 1
for char in t:
sCounts[char] -= 1
for item in sCounts.values():
if item != 0:
return False
return True
if __name__ == '__main__':
s = "anagram"
t = "nagaram"
print(isAnagram(s, t))