题目:
给你一个由不同字符组成的字符串 allowed
和一个字符串数组 words
。如果一个字符串的每一个字符都在 allowed
中,就称这个字符串是 一致字符串 。
请你返回 words
数组中 一致字符串 的数目。
示例:
输入:allowed = "ab", words = ["ad","bd","aaab","baa","badab"] 输出:2 解释:字符串 "aaab" 和 "baa" 都是一致字符串,因为它们只包含字符 'a' 和 'b' 。
输入:allowed = "abc", words = ["a","b","c","ab","ac","bc","abc"] 输出:7 解释:所有字符串都是一致的。
代码:
class Solution:
def countConsistentStrings(self, allowed: str, words: List[str]) -> int:
s1=set()
for i in allowed:
s1.add(i)
count=0
for word in words:
flag=True
for i in word:
if i not in s1:
flag=False
break
if flag:
count+=1
return count