原题链接:Valid Anagram
题目内容:
Given two strings s and t, write a function to determine if t is an anagram of s.
For example,
s = “anagram”, t = “nagaram”, return true.
s = “rat”, t = “car”, return 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?
给定两个字符串,判断是否是变位词。默认只包含小写字母。
引申:如果包含Unicode字符应该怎么做
Python
class Solution(object):
def isAnagram(self, s, t):
"""
:type s: str
:type t: str
:rtype: bool
"""
def statistic(string):
letters = [0 for i in range(0, 26)]
if not string:
return letters
for letter in string:
letters[ord(letter)-97] = letters[ord(letter)-97] + 1
return letters
return statistic(s) == statistic(t)
- 与LeetCode.387.First Unique Character in a String类似的思路,判断各类字符数是否相等。相等即互为变位词。
C++
class Solution {
public:
bool isAnagram(string s, string t) {
sort(s.begin(), s.end());
sort(t.begin(), t.end());
return s == t;
}
};
- 排序之后判断是否相等
Python.引申
class Solution(object):
def isAnagram(self, s, t):
"""
:type s: str
:type t: str
:rtype: bool
"""
def statistic(string):
letters = dict()
if not string:
return letters
for letter in string:
if ord(letter)-97 not in letters:
letters[ord(letter)-97] = 0
letters[ord(letter)-97] = letters[ord(letter)-97] + 1
return letters
return statistic(s) == statistic(t)
- ord函数可以接受unicode字符并转化为ascii码
- unicode字符多,不适用list格式,转变为dict以后,可以支持unicode字符,英文,标点等。