1.常用遍历算法
- <algorithm>涉及比较、交换、查找等操作
- <numeric>简单数学运算的模板函数
- <functional>定义模板类，声明函数对象
for_each;
//遍历容器for_each（beg，end，函数名），普通函数函数名，仿函数加括号
void print01(int val)
{
cout << val << " ";
}
//仿函数
class print02
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
void test01()
{
vector<int>v;
for (int i = 0; i < 10; i++)
{
v.push_back(i);
}
for_each(v.begin(),v.end(),print01);
cout << endl;
for_each(v.begin(), v.end(), print02());
}transform；
//搬运到另一个容器中，transform（iterator beg1，iterator end1，iterator beg 2，_func）;
目标容器要提前开辟空间resize
class Transform
{
public:
int operator()(int v)
{
return v;
}
};
void print01(int v)
{
cout<< v<<" ";
}
void test01()
{
vector<int>v;
for (int i = 0; i < 10; i++)
{
v.push_back(i);
}
vector<int> vTarget;
vTarget.resize(v.size());//目标容器提前开辟空间
transform(v.begin(), v.end(), vTarget.begin(), Transform());
//transform (v.begin,v.end(),vTarget.begin(), Transform());
for_each(vTarget.begin(), vTarget.end(), print01);
}
2.常用查找算法
查找指定元素，返回迭代器，找不到返回end
find;//查找元素
pos=find(v.begin(),v.end(),5)
//内置数据类型
void test01()
{
vector<int>v;
for (int i = 0; i < 10; i++)
{
v.push_back(i);
}
vector<int>::iterator pos=find(v.begin(),v.end(),5);
if (pos == v.end())
{
cout << "没找到" << endl;
}
else
{
cout << "找到了" << *pos << endl;
}
}
//自定义数据类型
class Person
{
public:
Person(string name,int age)
{
this->m_Name = name;
this->m_Age = age;
}
//重载==，让person数据可以对比
bool operator ==(const Person &p)
{
if (this->m_Name == p.m_Name&&this->m_Age == p.m_Age)
{
return true;
}
else
{
return false;
}
}
string m_Name;
int m_Age;
};
void test02()
{
vector<Person> v1;
Person p1("张三", 20);
Person p2("李四", 60);
Person p3("王五", 12);
Person p4("小花", 22);
v1.push_back(p1);
v1.push_back(p2 );
v1.push_back(p3);
v1.push_back(p4);
vector<Person>::iterator pos=find(v1.begin(), v1.end(), p1);
if (pos == v1.end())
{
cout << "没找到" << endl;
}
else
{
cout << "找到" << pos->m_Name << " 年龄为" << pos->m_Age << endl;
}
}find_if;//按条件查找元素
find_if(beg,end,谓词（仿函数）），谓词已经充当重载角色，因此不需要重载
//1.查找内置数据类型
class GreaterFive
{
public:
bool operator()(int val)
{
return val > 5;
}
};
void test01()
{
vector<int> v;
for (int i = 0; i < 10; i++)
{
v.push_back(i);
}
vector<int>::iterator pos = find_if(v.begin(), v.end(), GreaterFive());
if (pos == v.end())
{
cout << "没找到这个数" << endl;
}
else
{
cout << "找到这个数为" << *pos << endl;;
}
}
//2.自定义数据类型
class Person
{
public:
Person(string name, int age)
{
this->m_Name = name;
this->m_Age = age;
}
string m_Name;
int m_Age;
};
class Greater20
{
public:
bool operator()(const Person &p)
{
return p.m_Age > 20;
}
};
void test02()
{
vector<Person> v;
Person p1("张三",20);
Person p2("李四", 10);
Person p3("王五", 22);
Person p4("小红", 28);
v.push_back(p1);
v.push_back(p2);
v.push_back(p3);
v.push_back(p4);
vector<Person>::iterator pos = find_if(v.begin(), v.end(), Greater20());
if (pos == v.end())
{
cout << "没有找到年龄大于20的人" << endl;
}
else
{
cout << "找到年龄大于20的人为：" << pos->m_Name << " 年龄为：" << pos->m_Age << endl;
}
}adjacent_find;//查找相邻重复元素
adjacent_find(beg,end)查到相邻重复元素，返回第一个元素位置的迭代器
想要统计多个相邻重复元素，可以用count计数，使迭代器跳过该元素，再重新查找下一个重复元素
vector<int> v;
v.push_back(0);
v.push_back(2);
v.push_back(2);
v.push_back(3);
v.push_back(3);
v.push_back(0);
v.push_back(4);
v.push_back(4);
vector<int>::iterator pos=adjacent_find(v.begin(), v.end());
if (pos == v.end())
{
cout << "没有重复元素" << endl;
}
else
{
cout << "存在重复元素：" << *pos << endl;
}binary_search;//二分法查找
查找指定元素是否存在，查到返回true，不存在返回false
bool binary_search(beg,end,value)//无序序列不能用，结果未知
vector<int>v;
for (int i = 0; i < 10; i++)
{
v.push_back(i);
}
//查找容器中是否有9元素
bool ret=binary_search(v.begin(), v.end(), 9);
if (ret)
{
cout << "找到" << endl;
}
else
{
cout << "未找到" << endl;
}cout;//统计元素个数
自定义数据类型重载==号
//统计内置数据类型
void test01()
{
vector<int> v;
v.push_back(10);
v.push_back(30);
v.push_back(40);
v.push_back(20);
v.push_back(50);
v.push_back(40);
int num = count(v.begin(), v.end(), 40);
cout << "40的元素个数为：" << num << endl;
}
//2.自定义数据类型
class Person
{
public:
Person(string name, int age)
{
this->m_Name = name;
this->m_Age = age;
}
//重载
bool operator ==(const Person & p)
{
if (this->m_Age == p.m_Age)
{
return true;
}
else
{
return false;
}
}
string m_Name;
int m_Age;
};
void test02()
{
vector<Person> v;
Person p1("aaa", 12);
Person p2("bbb", 13);
Person p3("bbb", 13);
Person p4("bbb", 13);
Person p5("ccc", 23);
v.push_back(p1);
v.push_back(p2);
v.push_back(p3);
v.push_back(p4);
v.push_back(p5);
int num = count(v.begin(), v.end(), p2);
cout << "相同人数为：" << num << endl;
}cout_if//按条件统计元素个数
cout_if(beg end,_pred) _pred谓词
class Greater20
{
public:
bool operator()(int val)
{
return val > 20;
}
};
//统计内置数据类型
void test01()
{
vector<int> v;
v.push_back(10);
v.push_back(30);
v.push_back(40);
v.push_back(20);
v.push_back(50);
v.push_back(40);
int num = count_if(v.begin(), v.end(), Greater20());
cout << "大于20元素个数为：" << num << endl;
}
//2.自定义数据类型
class Person
{
public:
Person(string name, int age)
{
this->m_Name = name;
this->m_Age = age;
}
string m_Name;
int m_Age;
};
class Greater22
{
public:
bool operator()(const Person &p)
{
return p.m_Age > 22;
}
};
void test02()
{
vector<Person> v;
Person p1("张三", 20);
Person p2("李四", 10);
Person p3("王五", 22);
Person p4("小红", 28);
Person p5("小王", 30);
v.push_back(p1);
v.push_back(p2);
v.push_back(p3);
v.push_back(p4);
v.push_back(p5);
int num = count_if(v.begin(), v.end(), Greater22());
cout << "年龄大于22的有" << num << endl;
}3.常用排序算法
sort；//对容器内元素排序
sort（beg，end，_pred）,默认升序
void MyPrint(int val)
{
cout << val << " ";
}
void test01()
{
vector<int> v;
v.push_back(10);
v.push_back(4);
v.push_back(8);
v.push_back(6);
v.push_back(18);
v.push_back(22);
sort(v.begin(), v.end());
for_each(v.begin(), v.end(),MyPrint);
cout << endl;
//改为降序
sort( v.begin(), v.end(), greater<int>());
for_each(v.begin(), v.end(), MyPrint);
}random_shuffle;//指定范围内元素随机调整次序
random_shuffle(beg,end)指定区间内元素随机调整，记得加随机数种子
#include<ctime>
srand（（unsigned int）time（NULL））//随机种子
void MyPrint(int val)
{
cout << val << " ";
}
void test01()
{
vector<int> v;
v.push_back(8);
v.push_back(9);
v.push_back(10);
v.push_back(12);
v.push_back(16);
v.push_back(18);
random_shuffle(v.begin(), v.end());
for_each(v.begin(),v.end(),MyPrint);
}merge;//容器元素合并，存储到另一容器
merge(beg1,end1,beg2,end2,beg3);一定是有顺序的容器元素
第三个容器还要提前开辟空间，让v1.size（）+v2.size()相加就可以了
void MyPrint(int val)
{
cout << val << " ";
}
void test01()
{
vector<int> v1;
vector<int> v2;
for (int i = 0; i < 10; i++)
{
v1.push_back(i);
v2.push_back(i + 10);
}
vector<int> vTarget;
vTarget.resize(v1.size() + v2.size());
merge(v1.begin(), v1.end(), v2.begin(), v2.end(), vTarget.begin());
for_each(vTarget.begin(),vTarget.end(),MyPrint);
}reverse；//反转指定范围容器
reverse(beg,end)
4.常用拷贝和替换算法
copy//拷贝
copy（beg1，end1，beg2），记得开辟空间
vector<int> v1;
vector<int> v2;
for (int i = 0; i < 10; i++)
{
v1.push_back(i);
}
v2.resize(v1.size());
copy(v1.begin(), v1.end(), v2.begin());
for_each(v2.begin(),v2.end(),MyPrint);replace//旧元素替换成新元素
repalce（beg，end，old value ,new value）;只要满足条件就替换
repalce_if//指定范围内满足条件的元素替换
repalce_if(beg,end,_pred,newvalue);提供谓词
void MyPrint(int val)
{
cout << val << " ";
}
class Greater30
{
public:
bool operator ()(int val)
{
return val >= 30;
}
};
void test01()
{
vector<int> v1;
v1.push_back(10);
v1.push_back(20);
v1.push_back(10);
v1.push_back(30);
v1.push_back(40);
v1.push_back(50);
v1.push_back(20);
for_each(v1.begin(), v1.end(), MyPrint);
cout << endl;
//大于等于30的替换成3000
replace_if (v1.begin(), v1.end(), Greater30(), 3000);
for_each(v1.begin(),v1.end(),MyPrint);
cout << endl;
}swap//容器元素互换
互换两个容器中的元素
swap(v1,v2)必须是同类型的容器
5.常用算数生成算法
accumulate //计算容器内元素累计总和
accumlate(beg,end,value);value为起始累加值
vector<int> v1;
for (int i = 0; i <=100; i++)
{
v1.push_back(i);
}
int total=accumulate(v1.begin(),v1.end(),0);
cout << total << endl;fill//向容器中添加元素
fill(beg,end,value)指定区间内元素填充成value
用于后期填充
vector<int> v1;
for (int i = 0; i <= 10; i++)
{
v1.push_back(i);
}
fill(v1.begin(), v1.end(), 100);
for_each(v1.begin(), v1.end(), MyPrint);6.常用集合算法
set_intersection()//求交集
target.resize(min(v1.size(),v2.size()));//先开辟接受交集的空间
迭代器vector<>::iterator pos=set_intersection(beg1,end1,beg2,end2,target.beg3)//求出交集的最后一个位置，便于后续打印，否则会打印出多余的零
for_each(target.beg(),pos,print)
vector<int> v1;
for (int i = 0; i <= 10; i++)
{
v1.push_back(i);
}
vector<int> v2;
for (int i = 6; i <= 15; i++)
{
v2.push_back(i);
}
vector<int> vTarget;
//最特殊情况是大容器包含小容器
vTarget.resize(min(v1.size(),v2.size()));
vector<int>::iterator pos=set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), vTarget.begin());
for_each(vTarget.begin(), pos, MyPrint);set_union（）；//求并集
与交集用法相似，但要求两个容器的长度之和
vector<int> v1;
for (int i = 0; i <= 10; i++)
{
v1.push_back(i);
}
vector<int> v2;
for (int i = 6; i <= 15; i++)
{
v2.push_back(i);
}
vector<int> vTarget;
vTarget.resize(v1.size() + v2.size());
vector<int>::iterator pos=set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), vTarget.begin());
for_each(vTarget.begin(), pos, MyPrint);set_difference（）;//求差集
v2和v1的差集，就是v2有而v1没有的部分，v1和v2的差集是v1有而v2没有的部分
需要求两个容器中最大的容器长度
vector<int> v1;
for (int i = 0; i <= 10; i++)
{
v1.push_back(i);
}
vector<int> v2;
for (int i = 6; i <= 15; i++)
{
v2.push_back(i);
}
vector<int> vTarget;
vTarget.resize(max(v1.size(),v2.size()));
vector<int>::iterator pos = set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), vTarget.begin());
for_each(vTarget.begin(), pos, MyPrint);
cout << endl;
vector<int>::iterator pos1 = set_difference(v2.begin(), v2.end(), v1.begin(), v1.end(), vTarget.begin());
for_each(vTarget.begin(), pos1, MyPrint);
cout << endl;
1500
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
