2022.6.12-----leetcode. eight hundred and ninety

public List<String> findAndReplacePattern(String[] words, String pattern) {
        List<String> ans=new ArrayList<>();
        int n=words.length;
        int[] map=new int[26];// Storage pattern For each word Letters in 
        out:for(String word:words){
            Arrays.fill(map,-1);
            int mark=1<<26;// Mark the mapped word Letter 
            for(int j=0;j<pattern.length();j++){
                //pattern Letters have no mapping 
                if(map[pattern.charAt(j)-'a']==-1){
                    if((mark&(1<<(word.charAt(j)-'a')))!=0)// Judge word Whether the letters have been mapped 
                        continue out;
                    map[pattern.charAt(j)-'a']=word.charAt(j)-'a';
                    mark|=1<<(word.charAt(j)-'a');
                }else{
                    if(map[pattern.charAt(j)-'a']!=word.charAt(j)-'a')// Judge pattern Whether to map the same letter 
                        continue out;
                }
            }
            ans.add(word);
        }
        return ans;
    }