解题思路
首先一个for循环遍历整个vector，将访问到的字符串放在一个新的string里面，遍历这个string,遇到空格就单词数量+1。再把得到的结果放入一个新的vector，排序，位于vector最后的那个数字就是出现最多的次数
代码
class Solution
{
public:
int mostWordsFound(vector<string>& sentences)
{
vector<int> tempStorage;
string tempString = "";
int longest = 1;
for (size_t loop = 0; loop < sentences.size(); loop++)
{
tempString = sentences.at(loop);
for (size_t lengthLoop = 0; lengthLoop < tempString.length(); lengthLoop++)
{
if (tempString.at(lengthLoop) == ' ')
{
longest++;
}
}
tempStorage.push_back(longest);
longest = 1;
}
sort(tempStorage.begin(), tempStorage.end());
longest = tempStorage.at(tempStorage.size() - 1);
return longest;
}
};
Silverhand Miles 