LeetCode 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?

题意：给出两个字符串，看两个字符串是否是经过调换顺序的。

思路：将两个字符串按字典序排序，看是否相等。

代码如下：

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

        Arrays.sort(arr1);
        Arrays.sort(arr2);

        String s1 = new String(arr1);
        String t1 = new String(arr2);

        return s1.compareTo(t1) == 0;
    }
}