2017百度面试现场coding算法一

struct Item{
string word;
int count;
};
bool compare(Item &a,Item &b)
{
return a.word<b.word;
}
vector<Item> wordNum(string weight)
{
vector<Item> vec;
int len=weight.length();
int s=0;
for(int i=0;i<=len;i++)
{
if(weight[i]==' '||weight[i]=='\0')
{   string str=weight.substr(s,i-s);
s=i+1;
Item temp;
int flag=0;
for(int j=0;j<vec.size();j++)
{
if(vec[j].word==str)
{   vec[j].count++;
flag=1;
break;
}
}
if(flag==0)
{
temp.count=1;
temp.word=str;
vec.push_back(temp);
}
}
}
sort(vec.begin(),vec.end(),compare);
return vec;
}