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.

Note:

You may assume the string contains only lowercase alphabets.

思路:因为只包含小写字母，只需设置一个长度为26的计数就行

代码如下(已通过leetcode)

public class Solution {
    public boolean isAnagram(String s, String t) {
        if (s.length() != t.length())
return false;
String[] ss = new String[s.length()];
String[] tt = new String[t.length()];
for (int i = 0; i < s.length(); i++) {
ss[i] = "" + s.charAt(i);
tt[i] = "" + t.charAt(i);
}
Arrays.sort(ss);
Arrays.sort(tt);
boolean flag = true;
for (int i = 0; i < ss.length; i++) {
if (!ss[i].equals(tt[i])) {
flag = false;
}
}


return flag;
    }
}