C++STL算法篇transform转换元素算法

transform(beg,end,destBeg,op)的特点

1:迭代器类型：beg,end为输入迭代器，destBeg为输出迭代器
2：返回值：输出迭代器
3:算法功能：将源区间[beg,end)内每个元素调用op(elem)并将结果写到以destBeg起始的目标区间中
4：复杂度：线性复杂度
5:调用者必须保证目标区间有足够的空间否则应采用插入迭代器

#include<iostream>
#include<vector>
#include<functional>
using namespace std;
int main()
{
   //将c1内的每个元素的平方转移c2容器内
	vector<int>c1 = { 1,2,3,4,5 };
	vector<int>c2;	
	cout << "c1:";
	copy(c1.begin(), c1.end(), ostream_iterator<int>(cout, " "));
	cout << endl;
	
	transform(c1.begin(), c1.end(), back_inserter(c2), [](int i)->int { return i *= i; });

	cout << "c2:";
	copy(c2.begin(), c2.end(), ostream_iterator<int>(cout, " "));
	cout << endl;
}

transform(beg,end,sbeg,destBeg,op)

1:迭代器类型：beg,end为输入迭代器，destBeg为输出迭代器
2：返回值：输出迭代器
3:算法功能：区间[beg,end)和sbeg开头的区间的对于元素调用op(elem,selem)的返回结果转移到destBeg开头的区间
4：复杂度：线性复杂度
5:调用者必须保证sbeg开头的区间元素个数不少于区间[beg,end)以及destBeg开头的区间如果空间不够必须调用插入迭代器

#include<iostream>
#include<vector>
#include<functional>
using namespace std;

int main()
{
   //将c1、c2对应元素的乘积结果转移到c3
	vector<int>c1 = { 1,2,3,4,5 };
	vector<int>c2 = {1,2,3,4,5,6,7};
	vector<int>c3;
	cout << "c1:";
	copy(c1.begin(), c1.end(), ostream_iterator<int>(cout, " "));
	cout << endl;

	cout << "c2:";
	copy(c2.begin(), c2.end(), ostream_iterator<int>(cout, " "));
	cout << endl;

	transform(c1.begin(), c1.end(),c2.begin(), back_inserter(c3), [](int i,int j)->int { return i*j; });

	cout << "c3:";
	copy(c3.begin(), c3.end(), ostream_iterator<int>(cout, " "));
	cout << endl;
}	

op推荐采用lambdas表达式：lambdas