Leetcode 242. Valid Anagram

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

For example,
s = "anagram", t = "nagaram", return true.
s = "rat", t = "car", return false.

public class Solution {
    public boolean isAnagram(String s, String t) {
		if(s == null && t == null){
		    return true;
		}if((s==null || t == null)){
		    return false;
		}
		if(s.length() != t.length()){
		    return false;
		}
		char[] str = s.toCharArray();
		char[] str2 = t.toCharArray();

		Arrays.sort(str);
		Arrays.sort(str2);
		
		return Arrays.equals(str,str2);
    }
}