Leetcode 242. valid anagram

Given two strings s and t, return true if t is an anagram of s, and false otherwise.

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

Example 1:

Input: s = “anagram”, t = “nagaram”
Output: true
Example 2:

Input: s = “rat”, t = “car”
Output: false

Give the string s, t, Judge t Is it right? s The heterotopic words of .
That's judgment t Is the letter of s Rearrangement of letters in , Use each letter only once .

Ideas ：
t yes s Rearrangement of letters in , And each letter is only used once ; Means t Only use s Letters in , And only once ,
that s and t The length of must be equal , It must be false.

No matter how it is arranged , First of all, make sure s and t The number of each letter in must be consistent , If the number is inconsistent s No matter how you arrange it, it won't become t.
Then you only need to count the number of each letter , Then judge whether the number of each letter is consistent .

As for the details s How to arrange to get t , Don't care about this topic .

public boolean isAnagram(String s, String t) {
    
    if(s.length() != t.length()) return false;
    
    int[] sc = new int[26];
    int[] tc = new int[26];
    
    for(int i = 0; i < s.length(); i++) {
    
        sc[s.charAt(i) - 'a'] ++;
        tc[t.charAt(i) - 'a'] ++;
    }
    
    for(int i = 0; i < 26; i++) {
    
        if(sc[i] != tc[i]) return false;
    }
    return true;
}