242. valid anagram java_Valid Anagram(leetcode242)

Given two strings s and t, write a function to determine if t is an anagram of s.

Example 1:

Input: s = "anagram", t = "nagaram"

Output: true

Example 2:

Input: s = "rat", t = "car"

Output: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?

//如果是使用map 也是同样的效果 都是"桶"

public static boolean isAnagram(String s, String t) {

int[] alphabet = new int[26];

for (int i = 0; i < s.length(); i++) {

alphabet[s.charAt(i) - 'a']++;

}

for (int i = 0; i < t.length(); i++) {

alphabet[t.charAt(i) - 'a']--;

}

for (int i : alphabet) {

if (i != 0) {

return false;

}

}

return true;

}

//这是对字符数组 做了一个排序 然后比较

public static boolean isAnagram2(String s, String t) {

char[] sChar = s.toCharArray();

char[] tChar = t.toCharArray();

Arrays.sort(sChar);

Arrays.sort(tChar);

return Arrays.equals(sChar, tChar);

}

git:https://github.com/woshiyexinjie/leetcode-xin