算法简介:
- find //查找元素
- find_if //按条件查找元素
- adjacent_find //查找相邻重复元素
- binary_search //二分查找法
- count //统计元素个数
- count_if //按条件统计元素个数
一、find
功能描述
- 查找指定元素,找到返回指定元素的迭代器,找不到返回结束迭代器end()
函数原型
- find(iterator beg, iterator end, value);
//beg开始迭代器
//end结束迭代器
//value查找的元素
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
void test01()
{
vector<int> v;
for (int i=0; i < 10; i++)
{
v.push_back(i);
}
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", 30);
Person p3("ccc", 20);
Person p4("ddd", 40);
v.push_back(p1);
v.push_back(p2);
v.push_back(p3);
v.push_back(p4);
vector<Person>::iterator it =find(v.begin(), v.end(), p2);
if (it == v.end())
{
cout << "没有找到" << endl;
}
else
{
cout << "找到: " << (*it).m_name << (*it).m_age << endl;
}
}
int main()
{
test01();
test02();
}
二、find_if
函数原型
- find_if(iterator beg, iterator end, _pred);
beg 开始迭代器
end 结束迭代器
_pred函数或者谓词(返回bool类型的仿函数)
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
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;
}
}
//查找自定义数据类型
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", 30);
Person p3("ccc", 20);
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();
}
三、adjacent_find
函数原型
- adjacent_find(iterator beg, iterator end);
//查找相邻重复元素,返回相邻元素的第一个位置的迭代器
//beg开始迭代器
//end结束迭代器
#include <iostream>
using namespace std;
#include<vector>
#include<algorithm>
void test01()
{
vector<int> v;
v.push_back(0);
v.push_back(2);
v.push_back(0);
v.push_back(3);
v.push_back(0);
v.push_back(1);
v.push_back(1);
v.push_back(0);
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;
}
四、binary_search
函数原型
- bool binary_search(iterator beg, iterator endy, value);
//查找指定的元素,查到返回true,否则false
//注意在无序序列中不可用
//beg 开始迭代器
//end 结束迭代器
//value查找的元素
#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);
}
//v.push_back(2);
//查找容器中是否有9
//注意必须是有序序列
bool ret = binary_search(v.begin(), v.end(), 9);
if (ret == true)
{
cout << "找到了元素" << endl;
}
else
{
cout << "未找到" << endl;
}
}
int main()
{
test01();
system("pause");
return 0;
}
五、count
- count(iterator beg, iterator end, value);
//统计元素出现次数
//beg开始迭代器
//end结束迭代器
//value 统计的元素
#include <iostream>
using namespace std;
#include<vector>
#include<algorithm>
//1、内置数据类型
void test01()
{
vector<int> v;
v.push_back(10);
v.push_back(20);
v.push_back(20);
v.push_back(10);
v.push_back(20);
int num = count(v.begin(), v.end(), 20);
cout << "20的元素个数为: " << num << endl;
}
//2、自定义数据类型
class Person
{
public:
Person(string name, int age)
{
this->m_name = name;
this->m_age = age;
}
bool operator==(const Person & p) //const不能丢
{
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("刘备1", 20);
Person p2("刘备2", 30);
Person p3("刘备3", 40);
Person p4("刘备4", 50);
v.push_back(p1);
v.push_back(p2);
v.push_back(p3);
v.push_back(p4);
Person p("诸葛亮", 30);
int num = count(v.begin(), v.end(), p);
cout << "和诸葛亮同岁数的人个数为:" << num << endl;
}
int main()
{
test01();
test02();
system("pause");
return 0;
}
六、count_if
- count_if(iterator beg, iterator end,_Pred);
//按条件统计元素出现次数
//beg开始迭代器
//end结束迭代器
//_Pred谓词
#include <iostream>
using namespace std;
#include<vector>
#include<algorithm>
//1、内置数据类型
class Greater20
{
public:
bool operator()(int val)
{
return val > 20;
}
};
void test01()
{
vector<int> v;
v.push_back(10);
v.push_back(20);
v.push_back(20);
v.push_back(50);
v.push_back(60);
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;
}
bool operator==(const Person & p) //const不能丢
{
if (this->m_age == p.m_age)
{
return true;
}
else
{
return false;
}
}
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("刘备1", 20);
Person p2("刘备2", 30);
Person p3("刘备3", 40);
Person p4("刘备4", 50);
v.push_back(p1);
v.push_back(p2);
v.push_back(p3);
v.push_back(p4);
//统计大于30岁人员个数
int num = count_if(v.begin(), v.end(), AgeGreater20());
cout << "大于20岁人员个数为:" << num << endl;
}
int main()
{
test01();
test02();
system("pause");
return 0;
}