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.

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?

注意数据类型之间的转换使用。

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));}