LeetCode 242.Valid Anagram

摘要: LeetCode 242.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.
思路：将两个字符串都转换为含有每个元素的数组，再将两个数组排序，如果两个数组的每个元素都对应相同，则返回true，否则返回false。

language ：javascript

/**
* @param {string} s
* @param {string} t
* @return {boolean}
*/
var isAnagram = function(s, t) {
var sArray = s.split('').sort();
var tArray = t.split('').sort();
if(sArray.length != tArray.length){
return false;
}
var flag = true;
for(var i=0;i<sArray.length;i++){
if(sArray[i] != tArray[i]){
flag = false;
break;
}
}
return (flag? true : false);
};