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.給定兩個字串 s, t
要求實作一個演算法 判斷 s 是不是 t 的 anagram
s 如果是 t 的 anagram 需要符合以下條件
所以只要先檢查