2022.11.8-----leetcode.1684

 public int countConsistentStrings(String allowed, String[] words) {
        int mark=0;
        for(int i=0;i<allowed.length();i++){
            mark|=1<<(allowed.charAt(i)-'a');
        }
        int ans=0;
        for(int i=0;i<words.length;i++){
            int tmp=0;
            for(int j=0;j<words[i].length();j++){
                tmp|=1<<(words[i].charAt(j)-'a');
            }
        
            if((mark&tmp)==tmp)
                ans++;
        }
        return ans;
    }