Leecode(122)1684.同意一直字符串的数目-简单

给你一个由不同字符组成的字符串 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" 是一致字符串。

class Solution:
    def countConsistentStrings(self, allowed: str, words: List[str]) -> int:
        allowed_set = set(allowed)  # 使用集合加速字符查找
        count = 0
        
        for word in words:
            is_consistent = True  # 假设当前 word 是一致的
            
            for c in word:
                if c not in allowed_set:
                    is_consistent = False  # 发现不一致字符
                    break  # 终止当前 word 的检查
            
            if is_consistent:
                count += 1  # 只有当 word 是一致字符串时才增加计数
        
        return count

class Solution:
    def countConsistentStrings(self, allowed: str, words: List[str]) -> int:
        allowed_set = set(allowed)  # 使用集合加速字符查找
        count = 0
        
        for word in words:
            if all(c in allowed_set for c in word):
                count += 1
        
        return count