LeetCode——Valid Anagram

Description：

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 static boolean isAnagram(String s, String t) {
        if(s.equals(t)) {
            return true;
        }
        char[] ss = s.toCharArray();
        char[] tt = t.toCharArray();
        Arrays.sort(ss);
        Arrays.sort(tt);
        return (new String(ss)).equals((new String(tt)));
    }
}