C++ Primer 课后练习10.1，10.2，10.3，10.4，10.5，10.7，10.9

练习10.1-10.2
#include<iostream>
#include<algorithm>
#include<string>
#include<list>
using namespace std;
int main(void)
{
	int ia[] = { 12, 24, 8, 12, 24, 8, 21, 45, 89, 12, 56, 56 };
	int val = 24;
	int result = count(begin(ia), end(ia), val);
	cout << result << endl;

	list < string > list1= {"James", "Kobe", "Wade", "Iverson", "Curry"};
	string ival = "Kobe";
	cout << count(list1.begin(), list1.end(), ival) << endl;

	return 0;
	

}
******************************************************************************************************************

练习10.3-10.4
#include<iostream>
#include<vector>
#include<numeric>
using namespace std;
int main(void)
{
	vector<int> vec1(10, 10);
	vector<int> vec2 = { 10, 12, 12, 12, 12, 12, 121, 21, 212 };
	cout << accumulate(vec1.cbegin(), vec1.cend(), 0) << " " << accumulate(vec2.cbegin(), vec2.cend(), 0) << endl;
	
	vector<double> vec3 = { 0.1, 2.3, 3.1, 2, 3, 1 };
	cout << accumulate(vec3.cbegin(), vec3.cend(), 0) << endl;
	return 0;
}
**********************************************************************************************************************
练习10-5
#include<iostream>
#include<vector>
#include<numeric>
#include<algorithm>
using namespace std;
int main(void)
{
	vector<char *> roster1 = { "Kobe","J" };
	vector<char *> roster2 = { "Kobe","James"};
	cout << equal(roster1.cbegin(), roster1.cend(), roster2.cbegin()) << endl;
	return 0;
}

****************************************************************************************
练习10-6
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void)
{
	vector<int> vec1 = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
	for (auto ss : vec1)
		cout << ss << " " ;
	cout << endl;
	fill_n(vec1.begin(), vec1.size(), 0);
	for (auto ss : vec1)
		cout << ss << " ";
	cout << endl;
	return 0;
}
*********************************************************************************************
练习10-7，10-8
】#include<iostream>
#include<vector>
#include<algorithm>
#include<list>
#include<iterator>
using namespace std;
int main(void)
{
	vector<int> vec1 = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
	for (auto ss : vec1)
		cout << ss << " " ;
	cout << endl;
	fill_n(vec1.begin(), vec1.size(), 0);
	for (auto ss : vec1)
		cout << ss << " ";
	cout << endl;
	
	vector<int> vec2;
	list<int> list1;
	int i;
	while (cin >> i) list1.push_back(i);
	cout << list1.size() << endl;
	vec2.resize(list1.size());
	copy(list1.cbegin(), list1.cend(), vec2.begin());

	for (auto ss : vec2)
		cout << ss << " ";
	cout << endl;
	
	vector<int> vec3;
	vec3.reserve(10);
	fill_n(back_inserter(vec3), 10, 0);
	for (auto ss : vec3)
		cout << ss << " ";
	cout << endl;

	return 0;
	;
}
*******************************************************************************************
练习10-9
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
void elimDus(vector<string> & scentence)
{
	sort(scentence.begin(), scentence.end());
	auto iter = unique(scentence.begin(), scentence.end());
	scentence.erase(iter, scentence.end());

}
int main(void)
{
	vector<string> vec1 = { "the", "quick", "red", "fox"
		, "jumps", "over", "the", "slwe", "red", "turtle" };
	for (auto ss : vec1)
		cout << ss << " ";
	cout << endl;
	elimDus(vec1);
	for (auto ss : vec1)
		cout << ss << " ";
	cout << endl;
	return 0;

}