本来以为是一道十分简单的题目,然而…答案依旧有我们需要学习的地方。
通过一个函数将数据从namefile文件中存储进map
void populate_map(ifstream& in_file, map<string, vector<string> > &families)
{
string textline;
while (getline(in_file, textline))
{
string fam_name;
vector<string> child;
string::size_type pos = 0, prev_pos = 0, text_size = textline.size();
while ((pos = textline.find_first_of(' ', pos)) != string::npos) //对每个用' '分隔的字符串进行操作
{
string::size_type end_pos = pos - prev_pos;
if (!prev_pos) //当prev_pos为0时,为家庭的姓
{
fam_name = textline.substr(prev_pos, end_pos);
}
else
{
child.push_back(textline.substr(prev_pos, end_pos));
}
prev_pos = ++pos;
}
if (prev_pos < text_size) //处理最后一个孩子的名字
{
child.push_back(textline.substr(prev_pos, pos - prev_pos));
}
if (!families.count(fam_name)) //如果家庭不存在
{
families[fam_name] = child;
}
else //家庭存在
{
cerr << "sorry, the family " << fam_name << " is already exist!" << endl;
}
}
}
实现: