Article Directory
topic
1684. Count the number of consistent strings.
Give you a string of different characters allowed and a string array words. If every character of a string is in allowed, the string is said to be a consistent string.
Please return the number of consistent strings in the words array.
Example 1:
输入：allowed = "ab", words = ["ad","bd","aaab","baa","badab"]
输出：2
解释：字符串 "aaab" 和 "baa" 都是一致字符串，因为它们只包含字符 'a' 和 'b' 。
Example 2:
输入：allowed = "abc", words = ["a","b","c","ab","ac","bc","abc"]
输出：7
解释：所有字符串都是一致的。
Example 3:
输入：allowed = "cad", words = ["cc","acd","b","ba","bac","bad","ac","d"]
输出：4
解释：字符串 "cc"，"acd"，"ac" 和 "d" 是一致字符串。
prompt:
1 <= words.length <= 104
1 <= allowed.length <= 26
1 <= words[i].length <= 10
allowed 中的字符 互不相同 。
words[i] 和 allowed 只包含小写英文字母。
Problem solution (Java)
class Solution
{
public int countConsistentStrings(String allowed, String[] words)
{
int count = 0;
for(int index = 0;index < words.length;index++)
{
if(contained(words[index],allowed))
{
count++;
}
}
return count;
}
//判断s中的每一个字母是否都在allowed中
public boolean contained(String s, String allowed)
{
int count = 0;
for(int index = 0;index < s.length();index++)
{
char c = s.charAt(index);
for(int scan = 0;scan < allowed.length();scan++)
{
if(c == allowed.charAt(scan))
{
count++;
break;
}
}
}
return count == s.length();
}
}