只会求最长的单词,求最小的没思路:
class Solution {
public:
string longestWord(vector<string>& words) {
int a=words.size();
int t=0;
int max= words[0].size();
for (int i=0;i<a;i++)
{
if (words[i].size()>max)
{
max=words[i].size();
t=i;
}
}
return words[t];
}
};
看了https://www.cnblogs.com/grandyang/p/7817011.html
没搞懂,无序表