题目:2942. 查找包含给定字符的单词
思路:枚举每个字符,然后判断是否包含x即可,时间复杂度0(nm)。
C++版本:
class Solution {
public:
vector<int> findWordsContaining(vector<string>& words, char x) {
vector<int> v;
for(int i=0;i<words.size();i++){
if(words[i].contains(x)){
v.push_back(i);
}
}
return v;
}
};
JAVA版本:
class Solution {
public List<Integer> findWordsContaining(String[] words, char x) {
List<Integer> v=new ArrayList<Integer>();
for(int i=0;i<words.length;i++){
if(words[i].indexOf(x)>=0){
v.add(i);
}
}
return v;
}
}
Go版本:
func findWordsContaining(words []string, x byte) []int {
v:=[]int{}
for i,s:=range words {
for j:=0;j<len(s);j++ {
if s[j]==x {
v=append(v,i)
break
}
}
}
return v
}