Leetcode1160Find Words That Can Be Formed by Characters

Solutions:

public int countCharacters(String[] words, String chars) {
    int count = 0; //计算符合条件字符串总长度
    int[] chaNum = new int[26];//统计给定的chars中每个字母的个数
    //count char of chars String
    for (char c : chars.toCharArray())
        chaNum[c - ‘a‘]++;
    //compare each word in words
    //  simple making copy of chaNum array
    for (String word : words) {
        int[] chaNum1 = Arrays.copyOf(chaNum, chaNum.length);  //每次重新生成一个该次使用字符数的数组 判断是否使用超过限制个数
        int Tcount=0; //每个单词匹配的字母数
        for(char c:word.toCharArray()){
            if(chaNum1[c-‘a‘]>0){
                chaNum1[c-‘a‘]--;
                Tcount++;
            }else
                break;
        }
        if(Tcount==word.length())
            count+=Tcount;
    }
    return count;
}

Leetcode1160Find Words That Can Be Formed by Characters

原文：https://www.cnblogs.com/chengxian/p/12257240.html