最长单词-LintCode

给一个词典，找出其中所有最长的单词。
您在真实的面试中是否遇到过这个题？ Yes
样例
在词典
{
“dog”,
“google”,
“facebook”,
“internationalization”,
“blabla”
}
中, 最长的单词集合为 [“internationalization”]
在词典
{
“like”,
“love”,
“hate”,
“yes”
}
中，最长的单词集合为 [“like”, “love”, “hate”]

#ifndef C133_H#define C133_H#include<iostream>#include<vector>#include<string>using namespace std;class Solution {public:    /**    * @param dictionary: a vector of strings    * @return: a vector of strings    */    vector<string> longestWords(vector<string> &dictionary) {        // write your code here        vector<string> v;        if (dictionary.empty())            return v;        int count = 0;        string s;        for (int i = 0; i < dictionary.size(); ++i)        {            if (dictionary[i].size()>s.size())            {                v.clear();                v.push_back(dictionary[i]);                s = dictionary[i];            }            else if (dictionary[i].size() == s.size())            {                v.push_back(dictionary[i]);                s = dictionary[i];            }            else            {                continue;            }        }        return v;    }};#endif