C++ Primer课后练习10.20,10.21

//课后练习10.20
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<numeric>
using namespace std;
void elimdups(vector<string> & words)
{
	//按字典序排序
	sort(words.begin(), words.end());
	auto end_unique = unique(words.begin(), words.end());
	words.erase(end_unique, words.end());
}
void biggies(vector<string> & words,
	vector<string>::size_type sz)
{
	elimdups(words); //将word按字典序排序,删除重复单词
	stable_sort(words.begin(), words.end(),
		[](const string& s1, const string & s2){return s1.size() < s2.size(); });
	auto wc = count_if(words.begin(), words.end(),
		[sz](const string s){return s.size() >= sz; });
	cout << "there are " << wc << " words whose size is larger than 6" << endl;
	auto iter = words.end() - wc;
	for_each(iter, words.end(),
		[](const string & s){cout << s << endl; });
}
int main(void)

{vector<string> words;string word;while (cin >> word){words.push_back(word);}biggies(words, 6);return 0;}/*********************************************************************/

//课后练习10.21
#include<iostream>
using namespace std;
int main(void)
{
	int num = 20;
	auto result = [& num]()->bool{
		if (num>0){num--;return false;}
		else return true;
	};
	while (!result())
	{
		cout << num << endl;
	}
	cout << result() << endl;
}






评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值