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.

[思路]

sort 以后看是否相等

思路2: bitmap, 数字符个数是否相等.
代码如下:
排序后判相等

public class Solution {
public boolean isAnagram(String s, String t) {
char[] sArr = s.toCharArray();
char[] tArr = t.toCharArray();

Arrays.sort(sArr);
Arrays.sort(tArr);

return String.valueOf(sArr).equals(String.valueOf(tArr));
}
}

计数判相等

public class Solution {
    public boolean isAnagram(String s, String t) {

        int[] count = new int[26];
        for(int i = 0; i < s.length(); i ++)
            count[s.charAt(i)-'a'] ++;
        for(int i = 0; i < t.length(); i ++)
            count[t.charAt(i)-'a'] --;
        for(int i = 0; i < 26; i ++)
            if(count[i] != 0)
                return false;
        return true;

    }
}