# Question

Formatted question description: https://leetcode.ca/all/1160.html

 1160. Find Words That Can Be Formed by Characters

You are given an array of strings words and a string chars.

A string is good if it can be formed by characters from chars (each character can only be used once).

Return the sum of lengths of all good strings in words.

Example 1:

Input: words = ["cat","bt","hat","tree"], chars = "atach"
Output: 6
Explanation:
The strings that can be formed are "cat" and "hat" so the answer is 3 + 3 = 6.

Example 2:

Input: words = ["hello","world","leetcode"], chars = "welldonehoneyr"
Output: 10
Explanation:
The strings that can be formed are "hello" and "world" so the answer is 5 + 5 = 10.

Note:

1 <= words.length <= 1000
1 <= words[i].length, chars.length <= 100
All strings contain lowercase English letters only.



# Algorithm

We need to check whether the frequency of each character of each word meets the available frequency that the character can provide. In other words, if the character frequency of the current word is higher (for example, “hello” requires two “l”s and there is only one “l” in “helo”, then we need to skip the word). Calculate and sum the length of a word. If the cycle of each character of a word is completed, the length of the word.

# Code

Java

Java

class Solution {
public int countCharacters(String[] words, String chars) {
int sum = 0;
for (String word : words) {
if (canFormWord(word, chars))
sum += word.length();
}
return sum;
}

public boolean canFormWord(String word, String chars) {
int[] wordCount = new int;
int[] charsCount = new int;
char[] wordArray = word.toCharArray();
for (char c : wordArray)
wordCount[c - 'a']++;
char[] charsArray = chars.toCharArray();
for (char c : charsArray)
charsCount[c - 'a']++;
for (int i = 0; i < 26; i++) {
if (wordCount[i] > charsCount[i])
return false;
}
return true;
}
}