10.14
[] (const int &a, const int &b) {return a+b;}
答案
#include <iostream>
using namespace std;
int main(int argc, char *[])
{
auto sum = [] (int a, int b) { return a+b;};
cout << sum(1, 1) << endl;
return 0;
}
10.15
include <iostream>
using namespace std;
int fuc(int a)
{
auto sum = [a] (int b) {return a+b;}; //没有给b赋值
return sum;
}
int main()
{
cout << fuc(1) << endl;
return 0;
}
答案
#include <iostream>
using namespace std;
void add(int a)
{
auto sum = [a] (int b) {return a + b;};
cout << sum(1) << endl;
}
int main()
{
add(1);
add(2);
return 0;
}
10.16
void bigies(vector<string> words, vector<string>::size_type sz)
{
elimdups(words); //将words里的单词按字典序排列,删除重复单词
// 按长度排序,长度相同的单词维持字典序
stable_sort(words.begin(), words.end(), [] (const string &a, const string &b) {return a.size < b.size();});
//获取一个迭代器,指向满足size() >= sz的元素
auto wc = find_if(words.begin(), words.end(), [sz] (const string &a) {return a.size > sz;});
//计算满足size >= sz的元素的数目
auto count = words.end() - wc;
cout << count <<" "<< make_plural(count, "word", "s") << " of length " << sz << " or lenger " << endl;
//打印长度大于等于给定值的单词,每个单词后接一个空格
for_each(wc. words.end(), [] (const string &s) { cout << s << " ";});
cout << endl;
}