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 = “agaram”,return folse.
Note:you may assume string contains only lowercase alphabets.
中文解释：易位构词法，难度为easy。两种方法。
方法一：先排序再比较
class Solution { public: bool isAnagram(string s, string t) { sort(s.begin(), s.end()); sort(t.begin(), t.end()); return s == t; } };
方法二：统计每个字符出现的次数
class Solution { public: bool isAnagram(string s, string t) { vector<int> count(26, 0); for(int i = 0; i < s.size(); i ++) count[s[i]-‘a‘] ++; for(int i = 0; i < t.size(); i ++) count[t[i]-‘a‘] --; for(int i = 0; i < 26; i ++) if(count[i] != 0) return false; return true; } };
原文：http://www.cnblogs.com/xdjyw/p/5079960.html