第一种用到for/else
用for遍历set1
如果set1中元素全在set2中
则执行else,这就能实现判断是否一致
class Solution:
def countConsistentStrings(self, allowed: str, words: List[str]) -> int:
sum= 0
for i in words:
for j in set(w):
if j not in allowed:
break
else:
sum+= 1
return sum
第二种
先计算words中的一个字符串中有多少字符在allowed中,计数为a
再判断a是否等于该字符的长度,如果相等显然该字符串中所有字符都在allowed中
sum = 0
for i in words:
a = 0
for j in i:
if j in allowed:
a += 1
if a==len(i):
sum += 1
return sum