题目描述
请设计一个高效算法,再给定的字符串数组中,找到包含”Coder”的字符串(不区分大小写),并将其作为一个新的数组返回。结果字符串的顺序按照”Coder”出现的次数递减排列,若两个串中”Coder”出现的次数相同,则保持他们在原数组中的位置关系。
给定一个字符串数组A和它的大小n,请返回结果数组。保证原数组大小小于等于300,其中每个串的长度小于等于200。同时保证一定存在包含coder的字符串。
测试样例:
[“i am a coder”,”Coder Coder”,”Code”],3
返回:[“Coder Coder”,”i am a coder”]
class Coder {
public:
vector<string> findCoder(vector<string> A, int n) {
// write code here
vector<string> vec;
multimap<int, string,greater<int>> map;
for (int i = 0; i < n; i++)
{
string str = A[i];
transform(str.begin(),str.end(), str.begin(), ::tolower);
int pos = 0,count = 0;
while ((pos = str.find("coder")) != string::npos)
{
++count;
if (pos + 5 != str.size())
str = str.substr(pos + 5);
else
break;
}
if(count!=0)
map.insert(make_pair(count, A[i]));
}
for (multimap<int, string, greater<int>>::iterator iter = map.begin(); iter != map.end(); iter++)
vec.push_back((*iter).second);
return vec;
}
};
class Coder {
public:
vector<string> findCoder(vector<string> A, int n) {
// write code here
vector<string> vec;
multimap<int, string,greater<int>> map;
for (int i = 0; i < n; i++)
{
string str = A[i];
transform(str.begin(),str.end(), str.begin(), ::tolower);
int pos = 0,count = 0;
while ((pos = str.find("coder")) != string::npos)
{
++count;
str = str.substr(pos + 5);
}
if(count!=0)
map.insert(make_pair(count, A[i]));
}
for (multimap<int, string, greater<int>>::iterator iter = map.begin(); iter != map.end(); iter++)
vec.push_back((*iter).second);
return vec;
}
};
class Coder {
public:
static bool comple(const pair<int,string>&p1,const pair<int,string> &p2)
{
return p1.first>p2.first;
}
vector<string> findCoder(vector<string> A, int n) {
vector<pair<int,string>> v;
vector<string> outA;
for(auto it=A.begin();it!=A.end();++it)
{
string s=*it;
int count=0;
transform(s.begin(),s.end(),s.begin(),::tolower);
string::size_type pos=0;
while((pos=s.find("coder",pos))!=string::npos)
{
++count;
pos+=5;
}
if(count>0)
v.push_back(make_pair(count,*it));
}
stable_sort(v.begin(),v.end(),comple);
for(auto c:v)
{
outA.push_back(c.second);
}
return outA;
}
};