LeetCode 242 -Valid Anagram ( JAVA )

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.

public class Solution {
    public boolean isAnagram(String s, String t) {
        if(s.length()!=t.length()){
            return false;
        }
        char [] schar = s.toCharArray();
        char [] tchar = t.toCharArray();
        Arrays.sort(schar);
        Arrays.sort(tchar);
        
        return Arrays.equals(schar,tchar);
    }
}

总结：题目要求为，求2个数组是否为异序字符串，(tmd又读错题了！)，本题思路，如果出现字符串长度不同的直接为false，剩下的把他们换成字符数组，用Arrays.sort(); 排序字符数组，最后在Arrays.equals( , )比较。