[LeetCode] 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 * 104
• s and t consist of lowercase English letters.

---

풀이:

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
    
    if len(s) != len(t):
    	return False 
    
    CountS, CountT = {}, {}
    
    for i in range(len(s):
    	CountT[t[i]] = 1 + CountT.get(t[i],0) 
        CountT[t[i]] = 1 + CountT.get(t[i],0) 
    return CountS == CountT