LeetCode-893 Groups of Special-Equivalent Strings Solution (with Java)

1. Description:

Notes:

2. Examples:

3.Solutions: 

/**
 * Created by sheepcore on 2019-02-24
 */
class Solution {
    public int numSpecialEquivGroups(String[] A) {
        Set<String> set= new HashSet<>();
        for (String s: A){
            int[] odd= new int[26];
            int[] even= new int[26];
            for (int i=0; i<s.length(); i++){
                if (i%2==1) odd[s.charAt(i)-'a']++;
                else even[s.charAt(i)-'a']++;
            }
            String sig= Arrays.toString(odd)+Arrays.toString(even);
            set.add(sig);
        }
        return set.size();
    }
}