Package g1101_1200.s1160_find_words_that_can_be_formed_by_characters

Class Solution

java.lang.Object

g1101_1200.s1160_find_words_that_can_be_formed_by_characters.Solution

public class Solution
extends Object

1160 - Find Words That Can Be Formed by Characters.<p>Easy</p> <p>You are given an array of strings <code>words</code> and a string <code>chars</code>.</p> <p>A string is <strong>good</strong> if it can be formed by characters from chars (each character can only be used once).</p> <p>Return <em>the sum of lengths of all good strings in words</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> words = [&ldquo;cat&rdquo;,&ldquo;bt&rdquo;,&ldquo;hat&rdquo;,&ldquo;tree&rdquo;], chars = &ldquo;atach&rdquo;</p> <p><strong>Output:</strong> 6</p> <p><strong>Explanation:</strong> The strings that can be formed are &ldquo;cat&rdquo; and &ldquo;hat&rdquo; so the answer is 3 + 3 = 6.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> words = [&ldquo;hello&rdquo;,&ldquo;world&rdquo;,&ldquo;leetcode&rdquo;], chars = &ldquo;welldonehoneyr&rdquo;</p> <p><strong>Output:</strong> 10</p> <p><strong>Explanation:</strong> The strings that can be formed are &ldquo;hello&rdquo; and &ldquo;world&rdquo; so the answer is 5 + 5 = 10.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= words.length <= 1000</code></li> <li><code>1 <= words[i].length, chars.length <= 100</code></li> <li><code>words[i]</code> and <code>chars</code> consist of lowercase English letters.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	countCharacters(String[] words, String chars)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

countCharacters

public int countCharacters(String[] words,
 String chars)