【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 class Solution {
public boolean isAnagram(String s, String t) {
if("".equals(s) || "".equals(t)){
if(s.equals(t)){
return true;
}
return false;
}
char[] array1 = s.toCharArray();
char[] array2 = t.toCharArray();
Arrays.sort(array1);
Arrays.sort(array2);
return new String(array1).equals(new String(array2));
}
}