常用的遍历算法
void test2()
{
vector<int>v;
for (int i = 0; i < 10; i++)
{
v.push_back(i);
}
for_each(v.begin(), v.end(), [](int va){cout << va <<" "; });
cout <<"\n-------------------------\n";
vector<int>v2;
v2.resize(v.size());
transform(v.begin(), v.end(), v2.begin(),func);
for_each(v2.begin(), v2.end(), [](int va) {cout << va << " "; });
cout << endl;
}
常用的查找算法
find算法 查找元素
@param beg 容器开始迭代器
@param end 容器结束迭代器
@param value 查找的元素
@return 返回查找元素的位置
find_if算法 条件查找
@param beg 容器开始迭代器
@param end 容器结束迭代器
@param callback 回调函数或者谓词(返回bool类型的函数对象)
@return bool 查找返回true 否则false
*/
void test1()
{
vector<int>v;
for (int i = 0; i < 10; i++)
{
v.push_back(i);
}
for_each(v.begin(), v.end(),[](int va) {cout << va << " "; });
cout << endl;
vector<int>::iterator it;
it= find(v.begin(), v.end(), 5);
if (it != v.end())
{
cout << "find " << " it" << endl;
}
else
cout << "no find" << endl;
v.push_back(9);
it=adjacent_find(v.begin(), v.end());
if (it != v.end())
{
cout << "adjacent find " << " it" << endl;
}
else
cout << "no find" << endl;
bool ret;
ret=binary_search(v.begin(), v.end(), 2);
if (ret)
{
cout << "find" << endl;
}
else
cout << " no find "<<endl;
count算法 统计元素出现次数
@param beg 容器开始迭代器
@param end 容器结束迭代器
@param value回调函数或者谓词(返回bool类型的函数对象)
@return int返回元素个数
int num = count(v.begin(), v.end(), 5);
cout << "num = " << num << endl;
num = count_if(v.begin(), v.end(), func1);
cout << "num = " << num << endl;
}
常用的排序算法
void test3()
{
vector<int> v1;
vector<int> v2;
for (int i = 0; i < 10; i++)
{
v1.push_back(i+1);
v2.push_back(i+2);
}
merge算法 容器元素合并,并存储到另一容器中
注意 : 两个容器必须是有序的,顺序要一致
vector<int> v3;
v3.resize(v1.size() + v2.size());
merge(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin());
for_each(v3.begin(), v3.end(), [](int va){ cout << va << " "; });
sort(v1.begin(), v1.end(), greater<int>());
for_each(v1.begin(), v1.end(), [](int va) { cout << va << " "; });
cout << endl;
random_shuffle(v1.begin(), v1.end());
for_each(v1.begin(), v1.end(), [](int va) { cout << va << " "; });
cout << endl;
reverse (v1.begin(),v1.end());
}
拷贝和替换算法
vector<int> v(10, 3);
vector<int> v2(10, 3);
v2.resize(v.size());
copy(v.begin(), v.end(), v2.begin());
for_each(v.begin(), v.end(), [](int va) { cout << va << " "; });
vector<int>::iterator it=v.begin();
it += 3;
replace(v.begin(),it, 3, 66);
for_each(v.begin(), v.end(), [](int va) { cout << va << " "; });
cout << endl;
replace_if(v.begin(), v.end(), MyReplace , 30000);
算数生成算法
#include <numeric>
vector<int> v;
for (int i = 0; i < 10; i++)
{
v.push_back(i);
}
int num =accumulate(v.begin(), v. end(),0);
cout << "num=" << num<<endl;
v.resize(10);
fill(v.begin(), v.end(), 100);
for_each(v.begin(), v.end(), [](int val){cout << val << " "; });
cout << endl;
常用集合算法
set_intersection算法 求两个set集合的交集
注意:两个集合必须是有序序列
@param beg1 容器1开始迭代器
@param end1 容器1结束迭代器
@param beg2 容器2开始迭代器
@param end2 容器2结束迭代器
@param dest 目标容器开始迭代器
@return 目标容器的最后一个元素的迭代器地址
void test01()
{
vector<int>v1;
vector<int>v2;
for (int i = 0; i < 10;i++)
{
v1.push_back(i);
v2.push_back(i + 5);
}
vector<int>vTarget;
vTarget.resize(min(v1.size(), v2.size()));
vector<int>::iterator itEnd = set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), vTarget.begin());
for_each(vTarget.begin(), itEnd, [](int val){cout << val << " "; });
cout << endl;
}
void test02()
{
vector<int>v1;
vector<int>v2;
for (int i = 0; i < 10; i++)
{
v1.push_back(i);
v2.push_back(i + 5);
}
vector<int>vTarget;
vTarget.resize(v1.size() + v2.size());
vector<int>::iterator itEnd = set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), vTarget.begin());
for_each(vTarget.begin(), itEnd , [](int val){cout << val << " "; });
cout << endl;
}
void test03()
{
vector<int>v1;
vector<int>v2;
for (int i = 0; i < 10; i++)
{
v1.push_back(i);
v2.push_back(i + 5);
}
vector<int>vTarget;
vTarget.resize( max(v1.size(),v2.size()) );
vector<int>::iterator itEnd = set_difference(v2.begin(), v2.end(), v1.begin(), v1.end(), vTarget.begin());
for_each(vTarget.begin(), itEnd, [](int val){cout << val << " "; });
cout << endl;
}
*/