第十章 习题10-11-习题10-20

习题10-11

#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
using namespace std;
bool isShorter(const string &s1, const string &s2)
{
	return s1.size() < s2.size();
}

void main()
{
	vector<string> vec = { "the","quick","red","fox","jumps","over","the","slow","red","turtle" };
	vector<string> vec2 =vec, vec3 = vec;
	sort(vec.begin(), vec.end());
	auto end_unique = unique(vec.begin(), vec.end());
	vec.erase(end_unique, vec.end());
	for (auto it = vec.begin(); it != vec.end(); ++it)
		cout << *it << "  ";
	cout << endl;

	sort(vec2.begin(), vec2.end());
	end_unique = unique(vec2.begin(), vec2.end());
	vec2.erase(end_unique, vec2.end());
	sort(vec2.begin(), vec2.end(),isShorter);
	for (auto it = vec2.begin(); it != vec2.end(); ++it)
		cout << *it << "  ";
	cout << endl;

	sort(vec3.begin(), vec3.end());
	end_unique = unique(vec3.begin(), vec3.end());
	vec3.erase(end_unique, vec3.end());
	stable_sort(vec3.begin(), vec3.end(), isShorter);
	for (auto it = vec3.begin(); it != vec3.end(); ++it)
		cout << *it << "  ";
	cout << endl;
}

习题10-12

bool compareIsbn(const Sales_data& sale1, const Sales_data& sale2)
{
    return sale1.isbn().size() < sale2.isbn().size();
}

习题10-13

#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
using namespace std;
bool isShorter(const string &s1)
{
	return s1.size() >= 5;
}

void main()
{
	vector<string> vec = { "slow","red","turtle","their" ,"myself"};

	partition(vec.begin(), vec.end(), isShorter);
	for (auto it = vec.begin(); it != vec.end(); ++it)
		cout << *it << "  ";
	cout << endl;
}

习题10-14

#include<iostream>
using namespace std;
void main()
{
	auto f = [](int a, int b) {return a + b; };
	cout << f(3, 4) << endl;
}

习题10-15

#include<iostream>
using namespace std;
void main()
{
	int a = 3;
	auto f = [a]( int b) {return a + b; };
	cout << f( 4) << endl;
}

习题10-16

抄一遍吧

#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
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());
}
string make_plural(size_t ctr, const string &word, const string &ending)
{
	return (ctr > 1) ? word + ending : word;
}
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 << " " << make_plural(count, "word", "s") << "  of length  " << sz << "  or longer" << endl;
	for_each(wc, words.end(), [](const string &s) {cout << s << "  "; });
	cout << endl;
}
void main()
{
	vector<string> vec = { "the","quick","red","fox","jumps","over","the","slow","red","turtle" };
	biggies(vec, 4);
}

习题10-17

[] (const Sales_data& sale1, const Sales_data& sale2)
{ return sale1.isbn().size() < sale2.isbn().size();}

习题10-18

partition(words.begin(), words.end(), [sz](const string& str){ return str.size()>sz;});

习题10-19

stable_partition(words.begin(), words.end(), [sz](const string& str){ return str.size()>sz;});

习题10-20

#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
using namespace std;
bool isBiger(const string &str)
{
	return str.size() >= 6;
}
void main()
{
	vector<string> vec = { "the","quick","red","fox","jumps","over","the","slow","red","turtle" };
	cout << count_if(vec.begin(), vec.end(), isBiger)<<endl;
}