题目要求:
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.
思路:当两个字符串长度不同时,返回false;长度相同时,转换为数组,然后进行排序,逐一比较字母是否一致
public class Solution {
public boolean isAnagram(String s, String t) {
if(s.length()!=t.length())
{
return false;
}
char[] snew=s.toCharArray();
char[] tnew=t.toCharArray();
Arrays.sort(snew);
Arrays.sort(tnew);
for(int i=0;i<snew.length;i++)
{
if(snew[i]!=tnew[i])
{
return false;
}
}
return true;
}
}