编程题目:
原题:https://www.codewars.com/kata/consecutive-strings/train/cpp
题目描述:You are given an array strarr of strings and an integer k. Your task is to return the first longest string consisting of k consecutive strings taken in the array.
参考代码:
string longestConsec(vector<string> &strarr, int k)
{
//不满足条件的处理
if(strarr.size() == 0 || k>strarr.size() || k<0){
return "";
}
//用continue_str来存储数k个连续子串;
vector<string> continue_str;
for(size_t i=0;i<=strarr.size()-k;i++){
ostringstream oss;
copy(strarr.begin()+i,strarr.begin()+k+i,ostream_iterator<string>(oss,"")); //字符串的连接
string temp=oss.str();
continue_str.push_back(temp);
}
//遍历continue_str找出第一个最大的string;
string max_str;
for(size_t i=0;i<continue_str.size();i++)
{
if(continue_str[i].size()>max_str.size()){
max_str=continue_str[i];
}
}
return max_str;
}
这是一个编程挑战,要求从给定的C++代码中找到数组里最长的由k个连续字符串组成的字符串。挑战链接:https://www.codewars.com/kata/consecutive-strings/train/cpp。任务是返回这样的第一个字符串。
234

被折叠的 条评论
为什么被折叠?



