给一个词典,找出其中所有最长的单词。
在词典
{
"dog",
"google",
"facebook",
"internationalization",
"blabla"
}
中, 最长的单词集合为 ["internationalization"]
在词典
{
"like",
"love",
"hate",
"yes"
}
中,最长的单词集合为 ["like", "love", "hate"]
class Solution {
public:
/*
* @param dictionary: an array of strings
* @return: an arraylist of strings
*/
vector<string> longestWords(vector<string> &dictionary) {
// write your code here
int max=dictionary[0].size();
int m=dictionary.size();
vector<string> nm;
for(int i=0;i<m;i++){
if(dictionary[i].size()>max){
max=dictionary[i].size();
nm.clear();
}
if(dictionary[i].size()==max){
nm.push_back(dictionary[i]);
}
}
return nm;
}
};