- 分析
简单题,直接暴露搜索
- 代码
class Solution {
public:
int countConsistentStrings(string allowed, vector<string>& words) {
vector<int> vec(27, 0);
for(char c: allowed) vec[c - 'a' + 1] = 1;
int ans = 0;
for(string& s : words){
int n = s.length(), i = 0;
for(; i < n; i++){
if(vec[s[i] - 'a' + 1] == 0) break;
}
if(i == n) ans++;
}
return ans;
}
};