C++Primer第五版——习题答案详解(九)
习题答案目录:https://www.cnblogs.com/Mered1th/p/10485695.html
第10章 泛型算法
练习10.1
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
int t, n;
vector<int> vec;
cout << "请输入序列个数:" << endl;
cin >> n;
cout << "请输入序列:" << endl;
for (int i = 0;i < n;i++) {
cin >> t;
vec.push_back(t);
}
cout << "请输入要统计的值:" << endl;
int num;
cin >> num;
cout << count(vec.begin(), vec.end(), num) << endl;
system("pause");
return 0;
}
练习10.2
#include<iostream>
#include<algorithm>
#include<list>
#include<string>
using namespace std;
int main() {
int n;
string t;
list<string> lst;
cout << "请输入字符串个数:" << endl;
cin >> n;
cout << "请输入" << n << "个字符串:" << endl;
for (int i = 0;i < n;i++) {
cin >> t;
lst.push_back(t);
}
cout << "请输入要统计的字符串:" << endl;
string num;
cin >> num;
cout << count(lst.begin(), lst.end(), num) << endl;
system("pause");
return 0;
}
练习10.3
#include<iostream>
#include<numeric>
#include<vector>
using namespace std;
int main() {
vector<int> vec = { 1,2,3,4,5 };
int sum = accumulate(vec.begin(), vec.end(), 0);
cout << sum << endl;
return 0;
}
练习10.4
初始值设为0表示返回值为int类型,会有精度损失
练习10.5
equal会比较指针地址,而不是字符串值,比较的结果与string类型的不一致。
练习10.6
fill_n(vec.begin(),vec.size(),0);
练习10.7
a.lst和vec之间的大小未保证相同,vec.resize(lst.size)
b.vec.resize(10);
练习10.9
#include<iostream>
#include<numeric>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
void elimDups(vector<string> &words) {
sort(words.begin(), words.end());
auto end_unique = unique(words.begin(), words.end());
cout << "unique后:";
for (auto i : words) {
cout << i << " ";
}
cout << endl;
cout << "erase后:";
words.erase(end_unique, words.end());
for (auto i : words) {
cout << i << " ";
}
cout << endl;
}
int main() {
vector<string> words = { "abc","abc","abc","bcd","efg","bcd","eqd" };
elimDups(words);
system("pause");
return 0;
}
练习10.10
标准库算法对迭代器而不是容器进行操作。
练习10.11
#include<iostream>
#include<numeric>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
bool isShorter(const string &s1, const string &s2) {
return s1.size() < s2.size();
}
void elimDups(vector<string> &words) {
sort(words.begin(), words.end());
auto end_unique = unique(words.begin(), words.end());
words.erase(end_unique, words.end());
}
int main() {
vector<string> words = { "the","quick","red","fox","jumps","over","the","slow","red","turtle" };
elimDups(words);
stable_sort(words.begin(), words.end(), isShorter);
for (auto &i : words) {
cout << i << " ";
}
cout << endl;
system("pause");
return 0;
}
练习10.12
bool compareIsbn(const Sales_data &a, const Sales_data &b) {
return a.isbn() < b.isbn();
}
练习10.13
#include<iostream>
#include<numeric>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
bool cmp(const string &a) {
return a.size() >= 5;
}
int main() {
vector<string> words = { "the","quick","red","fox","jumps","over","the","slow","red","turtle" };
partition(words.begin(), words.end(), cmp);
for (auto &i : words) {
cout << i << " ";
}
cout << endl;
system("pause");
return 0;
}
练习10.14
#include<iostream>
using namespace std;
int main() {
auto f = [](int a,int b) {return a + b;};
cout << f(1, 2) << endl;
return 0;
}
练习10.15
#include<iostream>
using namespace std;
int main() {
int a = 1;
auto f = [a](int b) {return a + b;};
cout << f(2) << endl;
system("pause");
return 0;
}
练习10.16
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
vector<string> &elimDups(vector<string> &words)
{
sort(words.begin(), words.end());
auto end_unique = unique(words.begin(), words.end());
words.erase(end_unique, words.end());
return words;
}
void biggies(vector<string> &words, vector<string>::size_type sz)
{
elimDups(words);
stable_sort(words.begin(), words.end(),
[](const string &a, const string &b)
{ return a.size() < b.size(); });
auto wc = find_if(words.begin(), words.end(),
[sz](const string &a)
{ return a.size() >= sz; });
auto count = words.end() - wc;
cout << count << endl;
for(const auto s : words)
cout << s << " ";
cout << endl;
}
int main()
{
vector<string> vs = { "the","quick","red","fox","jumps","over","the","slow","red","turtle" };
biggies(vs, 5);
return 0;
}
练习 10.18-10.19
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
vector<string> &elimDups(vector<string> &words)
{
sort(words.begin(), words.end());
auto end_unique = unique(words.begin(), words.end());
words.erase(end_unique, words.end());
return words;
}
void biggies(vector<string> &words, vector<string>::size_type sz)
{
elimDups(words);
auto wc = partition(words.begin(), words.end(),
[sz](const string &a)
{ return a.size() >= sz; });
//auto wc = stable_partition(words.begin(), words.end(),
//[sz](const string &a)
//{ return a.size() >= sz; });
auto count = words.end() - wc;
cout << count << endl;
for (const auto s : words)
cout << s << " ";
cout << endl;
}
int main()
{
vector<string> vs = { "the","quick","red","fox","jumps","over","the","slow","red","turtle" };
biggies(vs, 5);
system("pause");
return 0;
}
练习10.20
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<string> words = { "the","quick","red","fox","jumps","over","the","slow","red","turtle" };
string::size_type sz = 6;
auto wc = count_if(words.begin(), words.end(),
[sz](const string &a)
{ return a.size() >= sz; });
cout << wc << endl;
system("pause");
return 0;
}
练习10.21
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int v = 5;
auto f = [&v]()->bool
{
if (v <= 0) return false;
else {
--v;
return true;
}
};
while (f()) {
cout << v << endl;
}
system("pause");
return 0;
}
练习10.22
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<functional>
using namespace std;
bool judge_size(string &s, string::size_type sz) {
return s.size() >= sz;
}
int main() {
vector<string> words = { "the","quick","red","fox","jumps","over","the","slow","red","turtle" };
cout << count_if(words.begin(), words.end(), bind(judge_size, placeholders::_1, 6)) << endl;
system("pause");
return 0;
}
练习10.23
假设要绑定的函数有n个参数,绑定取n + 1个参数。另外一个是函数本身的绑定。
练习10.24
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
bool check_size(string &s, int sz)
{
return s.size() < sz;
}
int main()
{
vector<int> vi = { 1,2,3,4,5,6 };
string s("aaaa");
auto iter = find_if(vi.begin(), vi.end(), bind(check_size, s, placeholders::_1));
cout << *iter << endl;
system("pause");
return 0;
}
练习10.25
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
vector<string> &elimDups(vector<string> &words)
{
sort(words.begin(), words.end());
auto end_unique = unique(words.begin(), words.end());
words.erase(end_unique, words.end());
return words;
}
bool check_size(const string &s, string::size_type sz)
{
return s.size() >= sz;
}
int main()
{
vector<string> vs = { "the","quick","red","fox","jumps","over","the","slow","red","turtle" };
auto iter = partition(vs.begin(), vs.end(), bind(check_size, placeholders::_1, 5));
for (const auto s : vs)
cout << s << " ";
cout << endl;
vs.erase(iter, vs.end());
for (const auto s : vs)
cout << s << " ";
cout << endl;
system("pause");
return 0;
}
后续部分之后再更新。。
C++Primer第五版——习题答案详解(九)的更多相关文章
- C++Primer第五版——习题答案详解(一)
习题答案目录:https://www.cnblogs.com/Mered1th/p/10485695.html 第1章 开始&&第2章 变量和基本类型 练习1.3 #include&l ...
- C++Primer第五版——习题答案详解(二)
习题答案目录:https://www.cnblogs.com/Mered1th/p/10485695.html 第3章 字符串.向量和数组 练习3.2 一次读入一整行 #include<iost ...
- C++Primer第五版——习题答案详解(三)
习题答案目录:https://www.cnblogs.com/Mered1th/p/10485695.html 第4章 表达式 练习4.10 while(cin>>i&&i ...
- C++Primer第五版——习题答案详解(四)
习题答案目录:https://www.cnblogs.com/Mered1th/p/10485695.html 第5章 语句 练习5.9 #include<iostream> #inclu ...
- C++Primer第五版——习题答案详解(五)
习题答案目录:https://www.cnblogs.com/Mered1th/p/10485695.html 第6章 函数 练习6.4 #include<iostream> using ...
- C++Primer第五版——习题答案详解(六)
习题答案目录:https://www.cnblogs.com/Mered1th/p/10485695.html 第7章 类 练习7.1 class Sales_data { public: std:: ...
- C++Primer第五版——习题答案详解(七)
习题答案目录:https://www.cnblogs.com/Mered1th/p/10485695.html 第8章 IO库 练习8.1 istream &iofunc(istream &a ...
- C++Primer第五版——习题答案详解(八)
习题答案目录:https://www.cnblogs.com/Mered1th/p/10485695.html 第9章 顺序容器 练习9.1 a.list,需要按字典序插入,可能插入位置在中间 b.d ...
- C++Primer第五版——习题答案详解(十)
习题答案目录:https://www.cnblogs.com/Mered1th/p/10485695.html 第11章 关联容器 练习11.3 #include<iostream> #i ...
随机推荐
- PAT 1065 A+B and C (64bit)
1065 A+B and C (64bit) (20 分) Given three integers A, B and C in [−], you are supposed to tell whe ...
- LL(1),LR(0),SLR(1),LR(1),LALR(1)的 联系与区别
一:LR(0),SLR(1),规范LR(1),LALR(1)的关系 首先LL(1)分析法是自上而下的分析法.LR(0),LR(1),SLR(1),LALR(1)是自下而上的分析法. ...
- Linux下的python3,virtualenv,Mysql、nginx、redis安装配置
常用服务安装部署 学了前面的Linux基础,想必童鞋们是不是更感兴趣了?接下来就学习常用服务部署吧! 安装环境: centos7 + vmware + xshell MYSQL(mariadb) ...
- base64详解及实现
概述 base64 说起来大家应该都是很熟悉的,很多类型的数据都可以转成base64的编码规则,例如图片,pdf,文本,邮件内容等. 什么是base64 根据RFC2045的定义,base64被定义为 ...
- Java集合类框架的最佳实践有哪些?
1.根据应用需要正确选择要使用的集合类型对性能非常重要,比如:假如知道元素的大小是固定的,那么选用Array类型而不是ArrayList类型更为合适. 2.有些集合类型允许指定初始容量.因此,如果我们 ...
- be动词的形式和用法
Be动词的形式: be, is, am, are, was, were, being, been 1.The man is back 2.They are back 3.He was back 4.T ...
- java集合之List。
实际上有两种List:一种是基本的ArrayList其优点在于随机访问元素,另一种是更强大的LinkedList它并不是为快速随机访问设计的,而是具有一套更通用的方法. List:次序是List最重要 ...
- day 10 函数入门
def login(): """ """ 执行函数不会报错
- python day21 ——面向对像-反射 getattr,内置方法
一.反射:用字符串数据类型的变量名来访问这个变量的值 上代码^_^ # class Student: # ROLE = 'STUDENT' # @classmethod # def check_cou ...
- C# 异步通信 网络聊天程序开发 局域网聊天室开发
Prepare 本文将使用一个NuGet公开的组件技术来实现一个局域网聊天程序,利用组件提供的高性能异步网络机制实现,免去了手动编写底层的困扰,易于二次开发,扩展自己的功能. 在Visual Stud ...