Given two strings s and t , write a function to determine if t is an anagram of s.
Example 1:
1 2 | Input: s = "anagram", t = "nagaram" Output: true |
Example 2:
1 2 | Input: s = "rat", t = "car" Output: false |
Note:
You may assume the string contains only lowercase alphabets.
Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?
PYTHON3:
解法：先进行排序，然后判断字符串是否相同
1 2 3 4 5 6 7 8 | class Solution: def isAnagram(self, s, t): """ :type s: str :type t: str :rtype: bool """ return sorted(s)==sorted(t) |
