2022.6.12-----leetcode.890

public List<String> findAndReplacePattern(String[] words, String pattern) {
        List<String> ans=new ArrayList<>();
        int n=words.length;
        int[] map=new int[26];//存儲pattern對應每個word中的字母
        out:for(String word:words){
            Arrays.fill(map,-1);
            int mark=1<<26;//標記已經映射的word字母
            for(int j=0;j<pattern.length();j++){
                //pattern字母沒有映射
                if(map[pattern.charAt(j)-'a']==-1){
                    if((mark&(1<<(word.charAt(j)-'a')))!=0)//判斷word字母是否已經映射
                        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')//判斷pattern是否映射同一字母
                        continue out;
                }
            }
            ans.add(word);
        }
        return ans;
    }