给寻找编程代码教程的朋友们精选了相关的编程文章，网友邴文敏根据主题投稿了本篇教程内容，涉及到Java C++统计一致字符串数目、Java C++题解LeetCode、Java C++统计一致字符串数目相关内容，已被155网友关注，下面的电子资料对本篇知识点有更加详尽的解释。
Java C++统计一致字符串数目
题目
思路：模拟
- 用一个哈希表记录可出现的字母，然后逐一遍历每个单词每个字母，符合条件则结果加一。
Java
class Solution {
public int countConsistentStrings(String allowed, String[] words) {
boolean[] hash = new boolean[26];
for (var a : allowed.toCharArray())
hash[a - 'a'] = true;
int res = 0;
stop : for (var word : words) {
for (var w : word.toCharArray()) {
if (!hash[w - 'a'])
continue stop;
}
res++;
}
return res;
}
}
C++
class Solution {
public:
int countConsistentStrings(string allowed, vector<string>& words) {
int hash[26] = {0};
for (auto a : allowed)
hash[a - 'a'] = true;
int res = 0;
for (auto& word : words) {
bool ok = true;
for (auto w : word) {
if (!hash[w - 'a']) {
ok = false;
continue;
}
}
if (ok)
res++;
}
return res;
}
};
Rust
impl Solution {
pub fn count_consistent_strings(allowed: String, words: Vec<String>) -> i32 {
let mut hash = vec![false; 26];
for a in allowed.as_bytes().iter() {
hash[(a - b'a') as usize] = true;
}
let mut res = 0;
for word in words {
let mut ok = true;
for w in word.as_bytes().iter() {
if !hash[(w - b'a') as usize] {
ok = false;
continue;
}
}
if ok {
res += 1;
}
}
res
}
}
以上就是Java C++题解leetcode 1684统计一致字符串的数目示例的详细内容，更多关于Java C++统计一致字符串数目的资料请关注码农之家其它相关文章！
