242. Valid Letter ectopic words (hash table)

Given two strings s and t , Write a function to determine t Whether it is s Letter heteronym of .

Example  1: Input : s = "anagram", t = "nagaram" Output : true

Example 2: Input : s = "rat", t = "car" Output : false

  Suppose the string contains only lowercase letters .

public boolean isAnagram(String s,String t){
        // Create a new array to record the number of occurrences of each character 
        int [] record = new int [26];
        // Traversal string , If the character appears once , Appear value plus one 
        for (char c:s.toCharArray()) {
            record[c-'a']+=1;
        }
        for (char c:t.toCharArray()) {
            record[c-'a']-=1;
        }
        // If every value in the array is 0, Then the two strings are letter ectopic words 
        for (int x:record) {
            if (x!=0){
                return false;
            }
        }
        return true;
    }

    public static void main(String[] args) {
        String s = "faker";
        String t = "kafer";
        Youxuaidezunyyiweici youxuaidezunyyiweici = new Youxuaidezunyyiweici();
        boolean b = youxuaidezunyyiweici.isAnagram(s,t);
        System.out.println(b);
    }

Output results ：

True