019统计一致字符串的数目
给你一个由不同字符组成的字符串 allowed 和一个字符串数组 words 。如果一个字符串的每一个字符都在 allowed 中,就称这个字符串是 一致字符串 。
请你返回 words 数组中 一致字符串 的数目。
示例 1:
输入:allowed = "ab", words = ["ad","bd","aaab","baa","badab"]
输出:2
解释:字符串 "aaab" 和 "baa" 都是一致字符串,因为它们只包含字符 'a' 和 'b' 。
示例 2:
输入:allowed = "abc", words = ["a","b","c","ab","ac","bc","abc"]
输出:7
解释:所有字符串都是一致的。
示例 3:
输入:allowed = "cad", words = ["cc","acd","b","ba","bac","bad","ac","d"]
输出:4
解释:字符串 "cc","acd","ac" 和 "d" 是一致字符串。
解法1: 写的复杂度比较高 排名很低
class Solution:
def countConsistentStrings(self, allowed: str, words: List[str]) -> int:
res = 0
for i in range(len(words)):
if len([1 for a in list(set(words[i])) if a in list(allowed)]) == len(set(words[i])) :
res += 1
return res
解法2:评论区学来的 厉害了
class Solution:
def countConsistentStrings(self, allowed: str, words: List[str]) -> int:
return sum([set(word) <= set(allowed) for word in words])
解法3:用上了find 做减法 最近发现做数据处理find还是挺好用的
class Solution:
def countConsistentStrings(self, allowed: str, words: List[str]) -> int:
num_result = len(words) #默认都是
for word in words:
for a_char in word:
if allowed.find(a_char)==-1:
num_result-=1 #一个字母不在allowed里面 就减去
break
return num_result