Parts of a list -- 7 kyu

原题

http://www.codewars.com/kata/parts-of-a-list/train/cpp

题目

Write a function partlist that gives all the ways to divide a list (an array) of at least two elements into two non-empty parts.

• Each two non empty parts will be in a pair (or an array for languages without tuples or a structin C - C: see Examples test Cases - )
• Each part will be in a string
• Elements of a pair must be in the same order as in the original array.

编写函数partlist,将字符串向量分成前缀和后缀，储存在一个向量里
例如
输入[“az”, “toto”, “picaro”, “zone”, “kiwi”]
输出[[“az”, “toto picaro zone kiwi”], [“az toto”, “picaro zone kiwi”], [“az toto picaro”, “zone kiwi”], [“az toto picaro zone”, “kiwi”]]

分析

遍历字符串向量，进行字符串拼接，字符串之间用空格连接

代码

class PartList
{
public:
    static std::vector<std::pair <std::string, std::string> > partlist(std::vector<std::string> &arr);
};
std::vector<std::pair<std::string,std::string> > PartList::partlist(std::vector<std::string> &arr){
   std::vector<std::pair<std::string,std::string> > str;
   for(size_t i = 0; i < arr.size()-1;i++){
     std::string prefix;
     std::string successor;
     for(size_t j = 0; j <= i;j++){
        prefix+=arr[j];
        prefix+=" ";
     }
     for(size_t j = i+1; j <　arr.size();j++){
        successor +=arr[j];
        successor +=" ";
     }
     prefix.pop_back();
     successor.pop_back();
     std::cout << prefix<<"<>"<<successor <<std::endl;
     str.push_back(make_pair(prefix,successor));
   }
   return str;
}

#include <iostream>
#include <vector>
#include <sstream>
#include <iterator>

using namespace std;
vector<pair<string, string>> Partlist(vector<string> const&arr){
    vector<pair<string, string>> res;
    for(size_t i=0;i<arr.size()-1;i++){
        // 第一个字符串
        ostringstream first_oss;
        copy(begin(arr),begin(arr)+i+1,ostream_iterator<string>(first_oss," "));
        string first = first_oss.str();
        first.pop_back();// 除去字符串最后一个空格
        // 第二个字符串
        ostringstream second_oss;
        copy(begin(arr)+i+1,end(arr),ostream_iterator<string>(second_oss," "));
        string second = second_oss.str();
        second.pop_back();// 除去字符串最后一个空格
        res.push_back(make_pair(first,second));
    }
    return res;
};

作者：jdzhangxin
链接：http://www.jianshu.com/p/b192f26c35c4
來源：简书
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。