C++Primer答案第十一章 .pdfVIP

C++Primer答案第⼗⼀章 11.1 map : 关联容器，存放key和value vector : 顺序容器，只存value 11.2 list: 经常在任何位置删除添加数据 vector: 没别的要求⼀般就⽤它 deque: 栈 map: 字典 set: 数学集合 11.3 and 11,4 #include iostream #include map #include string #include cctype using namespace std; string change(string s) { string temp; for(auto i : s) { if(isalpha(i)) temp += tolower(i); } return temp; } int main(int argc, char *argv[]) { mapstring, size_t word_count; string word; while (cin word) { if(word == break) break; word = change(word); ++word_count[word]; } for(auto i : word_count) cout i.first occurs i.second ((i.second 1)? times : time ) endl; return 0; } /*输出 cat cat, dog fish Cat break cat occurs 3 times dog occurs 1 time fish occurs 1 time */ 11.7 mapstring, vectorstring home; home[Tom].push_back(Jack); 11.8 #include iostream #include string #include vector using namespace std; int main(int argc, char *argv[]) { vectorstring words = {dog, cat, apple}; string word = dog; if(find(words.cbegin(), words.cend(), word) == words.cend()) words.push_back(word); for(auto i : words) cout i ; cout endl; return 0; } 11.9 mapstring, listint m; 11.10 都不能 no viable overloaded operator[] for type mapvectorint::iterator, int (aka map__wrap_iterint *, int) 11.11 multisetSales_data, bool (*)(const Sales_data lhs, const Sales_data rhs) bookstore(compareIsbn); 11.12 vectorpairstring, int vec; vec.emplace_back(sss, 1); 11.13 第⼀种最简单（clang-tidy) vec.emplace_back(sss, 1); vec.push_back({sss, 1}); vec.push_back(make_pair(sss, 1)); 11.14 mapstring, vectorpairstring, string m; 11.15 mapped_type : vectorint