Day041 - 242. Valid Anagram

242. Valid Anagram

Given two strings s and t, return true if t is an

anagram

of s, and false otherwise.

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.

Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?

내 풀이

from collections import Counter

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        # s와 t의 길이가 다르면 return False
        if len(s) != len(t): return False
        
        # 포함된 단어들을 Counter를 이용해 등장횟수를 센 후 key 기준으로 sorting
        s = sorted(Counter(s).items(), key=lambda x: x[0])
        t = sorted(Counter(t).items(), key=lambda x: x[0])

        if s == t: return True
        return False

# Time Complexity : \(O(N)\)