반응형
242. Valid Anagram
Easy
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
andt
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:
if len(s) != len(t): return False
A = Counter(s)
B = Counter(t)
return (A==B)
728x90
반응형
'알고리즘 > LeetCode_Grind75' 카테고리의 다른 글
Grind75 - 121. Best Time to Buy and Sell Stock 파이썬 (0) | 2024.11.19 |
---|---|
Grind75 - 704. Binary Search 파이썬 (0) | 2024.11.18 |
Grind75 - 125. Valid Palindrome 파이썬 (3) | 2024.11.04 |
Grind75 - 20. Valid Parentheses 파이썬 (0) | 2024.10.27 |
Grind75 - 1. Two Sum 파이썬 (0) | 2024.10.21 |