Sword finger offer II 032 Effective anagrams

Summary

The number of characters saved in the hash table , Then compare .

subject

Given two strings s and t , Write a function to determine whether they are a group of modifiers （ Letter heterotopic word ）.

Be careful ： if s and t The number of occurrences of each character is the same and the character order is not exactly the same , said s and t Each other is a modifier （ Letter heterotopic word ）.

link ：https://leetcode.cn/problems/dKk3P7

Ideas

Determine whether two strings are equal , Equal return false.

Traverse two strings , Count the number of occurrences of each character , Then compare whether they are equal .

solution ： Use the length of 26 The array of is used as a hash table to save the number of characters

Code

public boolean isAnagram(String s, String t) {
    
    if (s.equals(t)) {
    
        return false;
    }

    int[] sArray = new int[26];
    int[] tArray = new int[26];
    for (char c : s.toCharArray()) {
    
        sArray[c - 'a']++;
    }
    for (char c : t.toCharArray()) {
    
        tArray[c - 'a']++;
    }
    for (int i = 0; i < 26; i++) {
    
        if (sArray[i] != tArray[i]) {
    
            return false;
        }
    }

    return true;
}