Class Solution
java.lang.Object
g1101_1200.s1160_find_words_that_can_be_formed_by_characters.Solution
public class Solution
extends java.lang.Object
1160 - Find Words That Can Be Formed by Characters.
Easy
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.
Constraints:
1 <= words.length <= 1000
1 <= words[i].length, chars.length <= 100
words[i]
andchars
consist of lowercase English letters.
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionint
countCharacters
(java.lang.String[] words, java.lang.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(java.lang.String[] words, java.lang.String chars)
-