[LeetCode] 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?

经典的变位词问题，编程珠玑里有。把每个词排序后如果一样就说明是变位词。

其实一开始叫我用js 写我是拒绝的。

/**
 * @param {string} s
 * @param {string} t
 * @return {boolean}
 */
var isAnagram = function(s, t) {
    var ss = s.split("").sort().join("");
    var st = t.split("").sort().join("");
    return ss == st;
};

[LeetCode] Valid Anagram

原文：http://www.cnblogs.com/agentgamer/p/4898639.html