一、算法简介
- find //查找元素
- find_if //按条件查找元素
- adjacent_find //查找相邻重复元素
- binary_search //二分查找法
- count //统计元素个数
- count_if //按条件统计元素个数
二、find
1、功能描述
- 查找指定元素,找到返回指定元素的迭代器,找不到返回结束迭代器end()
2、函数原型
- find(iterator beg,iterator end,value); //按值查找元素
- // value 查找的元素
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;
#include<algorithm>
#include<vector>
//查找内置数据类型
void test01()
{
vector<int>v;
for (int i = 0; i < 10; i++)
{
v.push_back(i);
}
//查找容器中是否有5这个元素
vector<int>::iterator it = find(v.begin(), v.end(), 5);
if (it == v.end())
{
cout << "没有找到" << endl;
}
else
{
cout << "找到:" << *it << endl;
}
}
//查找自定义数据类型
class Person
{
public:
Person(string name, int age)
{
this->m_Name = name;
this->m_Age = age;
}
//重载底层 使底层find知道如何对比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>v;
//创建数据
Person p1("aaa", 10);
Person p2("bbb", 20);
Person p3("ccc", 30);
Person p4("ddd", 40);
//放入到容器中
v.push_back(p1);
v.push_back(p2);
v.push_back(p3);
v.push_back(p4);
Person pp("bbb", 20);
vector<Person>::iterator it = find(v.begin(), v.end(), pp);
if (it == v.end())
{
cout << "没有找到" << endl;
}
else
{
cout << "找到元素 姓名:" << it->m_Name << " 年龄:" << it->m_Age << endl;
}
}
int main()
{
test01();
test02();
system("pause");
return 0;
}
![](https://i-blog.csdnimg.cn/blog_migrate/1faa44ba2c1af5ce76de532e0bacb9d9.png)
三、find_if
1、功能描述
2、函数原型
- find_if(iterator beg,iterator end,_Pred); //按条件查找元素
- // _Pred 函数或谓词(返回bool类型的仿函数)
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;
#include<algorithm>
#include<vector>
//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 it = find_if(v.begin(), v.end(), GreaterFive());
if (it == v.end())
{
cout << "没有找到" << endl;
}
else
{
cout << "找到大于5的数字为:" << *it << 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()(Person& p)
{
return p.m_Age > 20;
}
};
void test02()
{
vector<Person>v;
//创建数据
Person p1("aaa", 10);
Person p2("bbb", 20);
Person p3("ccc", 30);
Person p4("ddd", 40);
v.push_back(p1);
v.push_back(p2);
v.push_back(p3);
v.push_back(p4);
//找年龄大于20的人
vector<Person>::iterator it = find_if(v.begin(), v.end(), Greater20());
if (it == v.end())
{
cout << "没有找到" << endl;
}
else
{
cout << "找到 姓名:" << it->m_Name << " 年龄:" << it->m_Age << endl;
}
}
int main()
{
test01();
test02();
system("pause");
return 0;
}
![](https://i-blog.csdnimg.cn/blog_migrate/4830ee8d7a22f92c51022658675baa24.png)
四、adjacent_find
1、功能描述
2、函数原型
- adjacent_find(iterator beg,iterator end);
- // 查找相邻重复元素,返回相邻元素的第一个位置的迭代器
- // beg 开始迭代器
- // end 结束迭代器
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;
#include<algorithm>
#include<vector>
void test01()
{
vector<int>v;
v.push_back(0);
v.push_back(2);
v.push_back(0);
v.push_back(3);
v.push_back(1);
v.push_back(4);
v.push_back(3);
v.push_back(3);
vector<int>::iterator pos = adjacent_find(v.begin(), v.end());
if (pos == v.end())
{
cout << "未找到相邻重复元素" << endl;
}
else
{
cout << "找到相邻重复元素" << *pos << endl;
}
}
int main()
{
test01();
system("pause");
return 0;
}
![](https://i-blog.csdnimg.cn/blog_migrate/5d6cf3b4b938aa08f77e0f42c59f686d.png)
五、binary_search
1、功能描述
2、函数原型
- bool binary_search(iterator beg,iterator end,value);
- // 查找指定元素,查到 返回true,否则 false
- // 注意:在无序序列中不可用
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
void test01()
{
vector<int>v;
for (int i = 0; i < 10; i++)
{
v.push_back(i);
}
//查找容器中是否有9元素
//注意:容器必须是有序的序列
//v.push_back(2); //如果是无序序列,结果未知!
bool ret = binary_search(v.begin(), v.end(), 9);
if (ret)
{
cout << "找到了元素" << endl;
}
else
{
cout << "未找到" << endl;
}
}
int main()
{
test01();
system("pause");
return 0;
}
![](https://i-blog.csdnimg.cn/blog_migrate/81a8e8a96cdb42d1c95958bc1e2d6a11.png)
六、count
1、功能描述
2、函数原型
- count(iterator beg,iterator end,value);
- // 统计元素出现次数
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
//1、统计内置数据类型
void test01()
{
vector<int>v;
v.push_back(10);
v.push_back(40);
v.push_back(30);
v.push_back(40);
v.push_back(20);
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("刘备", 35);
Person p2("关羽", 35);
Person p3("赵云", 35);
Person p4("张飞", 30);
Person p5("曹操", 40);
//将人员插入到容器中
v.push_back(p1);
v.push_back(p2);
v.push_back(p3);
v.push_back(p4);
v.push_back(p5);
Person p("诸葛亮", 35);
int num = count(v.begin(), v.end(), p);
cout << "和诸葛亮同岁数的人员个数为:" << num << endl;
}
int main()
{
test01();
test02();
system("pause");
return 0;
}
![](https://i-blog.csdnimg.cn/blog_migrate/846728ccc729f4b1b88d87166967dcc3.png)
七、count_if
1、功能描述
2、函数原型
- count_if(iterator beg,iterator end,_Pred);
- // _Pred 谓词
#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
//统计内置数据类型
class Greater20
{
public:
bool operator()(int val)
{
return val > 20;
}
};
void test01()
{
vector<int>v;
v.push_back(10);
v.push_back(40);
v.push_back(30);
v.push_back(40);
v.push_back(20);
v.push_back(40);
int num = count_if(v.begin(), v.end(), Greater20());
cout << "大于20的元素个数为:" << num << endl;
}
//统计自定义数据类型
class Person
{
public:
Person(string name, int age)
{
this->m_Name = name;
this->m_Age = age;
}
string m_Name;
int m_Age;
};
class AgeGreater20
{
public:
bool operator()(const Person& p)
{
return p.m_Age > 20;
}
};
void test02()
{
vector<Person>v;
Person p1("刘备", 35);
Person p2("关羽", 35);
Person p3("赵云", 35);
Person p4("张飞", 30);
Person p5("曹操", 40);
//将人员插入到容器中
v.push_back(p1);
v.push_back(p2);
v.push_back(p3);
v.push_back(p4);
v.push_back(p5);
//统计大于20岁人员个数
int num = count_if(v.begin(), v.end(), AgeGreater20());
cout << "大于20岁人员个数为:" << num << endl;
}
int main()
{
test01();
test02();
system("pause");
return 0;
}
![](https://i-blog.csdnimg.cn/blog_migrate/97b09c5065857d37ba952e8e40a3d7a8.png)