Class Solution
java.lang.Object
g1601_1700.s1684_count_the_number_of_consistent_strings.Solution
1684 - Count the Number of Consistent Strings.<p>Easy</p>
<p>You are given a string <code>allowed</code> consisting of <strong>distinct</strong> characters and an array of strings <code>words</code>. A string is <strong>consistent</strong> if all characters in the string appear in the string <code>allowed</code>.</p>
<p>Return <em>the number of <strong>consistent</strong> strings in the array</em> <code>words</code>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> allowed = “ab”, words = [“ad”,“bd”,“aaab”,“baa”,“badab”]</p>
<p><strong>Output:</strong> 2</p>
<p><strong>Explanation:</strong> Strings “aaab” and “baa” are consistent since they only contain characters ‘a’ and ‘b’.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> allowed = “abc”, words = [“a”,“b”,“c”,“ab”,“ac”,“bc”,“abc”]</p>
<p><strong>Output:</strong> 7</p>
<p><strong>Explanation:</strong> All strings are consistent.</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> allowed = “cad”, words = [“cc”,“acd”,“b”,“ba”,“bac”,“bad”,“ac”,“d”]</p>
<p><strong>Output:</strong> 4</p>
<p><strong>Explanation:</strong> Strings “cc”, “acd”, “ac”, and “d” are consistent.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= words.length <= 10<sup>4</sup></code></li>
<li><code>1 <= allowed.length <= 26</code></li>
<li><code>1 <= words[i].length <= 10</code></li>
<li>The characters in <code>allowed</code> are <strong>distinct</strong>.</li>
<li><code>words[i]</code> and <code>allowed</code> contain only lowercase English letters.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
countConsistentStrings
-