public class Solution
{
public int CountConsistentStrings(string allowed, string[] words)
{
var allowedList = allowed.ToList();
var count = 0;
foreach (var w in words)
{
if (IsConsistent(allowedList, w))
{
count++;
}
}
return count;
}
/// <summary>
/// 判断一致字符串
/// </summary>
/// <param name="allowed">依据字符列表</param>
/// <param name="target">目标字符串</param>
/// <returns>是否为一致字符串</returns>
private bool IsConsistent(List<char> allowed, string target)
{
foreach (var c in target)
{
if (!allowed.Contains(c))
{
return false;
}
}
return true;
}
}
3. 解题思路2
关键点:如何判断一个字符串是一致字符串。
解题步骤:
a. 假定每个words中每个字符串都是一致字符串
a. 遍历words中字符串
b. 遍历【a】步骤中的每一个字符,如果字符在allowed中不存在,则结果减一
python
classSolution:defcountConsistentStrings(self, allowed:str, words: List[str])->int:
count =len(words)for w in words:for c in w:if allowed.find(c)==-1:
count -=1breakreturn count