STL:常用查找算法

在这里插入图片描述
在这里插入图片描述
find查找内置数据类型:

//查找内置数据类型
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;
	}
}

find查找自定义数据类型:

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 test01()
{
	vector<Person>v1;

	Person p1("qqq", 10);
	Person p2("rrr", 30);
	Person p3("ddd", 80);
	Person p4("fff", 90);
	
	v1.push_back(p1);
	v1.push_back(p2);
	v1.push_back(p3);
	v1.push_back(p4);


	vector<Person>::iterator it = find(v1.begin(), v1.end(), p2);
	if (it == v1.end())
	{
		cout << "没找到" << endl;
	}
	else
	{
		cout << "姓名:" << it->m_name << " 年龄:" << it->m_age;
	}
}

记住find可以在容器中找指定的元素,返回值是迭代器
在这里插入图片描述
//查找内置数据类型

//查找内置数据类型
class GreaterFive
{
public:
	bool operator()(int val)
	{
		return val > 5;
	}
};


void test()
{
	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 << "no" << endl;
	}
	else
	{
		cout << "找到了" << *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 Greater
{
public:
	bool operator()(Person &p)
	{
		return p.m_age > 20;
	}
};

void test01()
{
	vector<Person>v1;

	Person p1("qqq", 10);
	Person p2("rrr", 30);
	Person p3("ddd", 80);
	Person p4("fff", 90);
	
	v1.push_back(p1);
	v1.push_back(p2);
	v1.push_back(p3);
	v1.push_back(p4);

	//找年龄大于20
	vector<Person>::iterator it = find_if(v1.begin(), v1.end(), Greater());
	if (it == v1.end())
	{
		cout << "没找到" << endl;
	}
	else
	{
		cout << "姓名:" << it->m_name << " 年龄:" << it->m_age << endl;
	}
}

在这里插入图片描述

void test02()
{
	vector<int>v;
	v.push_back(0);
	v.push_back(3);
	v.push_back(1);
	v.push_back(3);
	v.push_back(2);
	v.push_back(3);
	v.push_back(3);

	vector<int>::iterator it = adjacent_find(v.begin(), v.end());
	if (it == v.end())
	{
		cout << "没找到相邻重复元素" << endl;
	}
	else
	{
		cout << "找到了相邻重复元素:" << *it << endl;
	}
}

ps:面试题中如果出现查找重复元素,记得STL中的adjacent_find算法

**二分查找:**必须是有序序列,否则结果位置
在这里插入图片描述

void test02()
{

	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;
	}
}

在这里插入图片描述
//统计自定义数据类型

//统计自定义数据类型
void test02()
{

	vector<int>v;
	v.push_back(0);
	v.push_back(3);
	v.push_back(1);
	v.push_back(3);
	v.push_back(2);
	v.push_back(3);
	v.push_back(3);


	int num = count(v.begin(), v.end(), 3);
	cout << num << endl;//4
	
	
}

//统计自定义数据类型

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 test01()
{
	vector<Person>v1;

	Person p1("qqq", 10);
	Person p2("rrr", 10);
	Person p3("ddd", 80);
	Person p4("fff", 90);
	
	v1.push_back(p1);
	v1.push_back(p2);
	v1.push_back(p3);
	v1.push_back(p4);

	Person p("ooo", 10);//找一找有没有跟ooo同年龄的人,统计一下有几个

	int num = count(v1.begin(), v1.end(), p);

	cout << num << endl;//2
}

在这里插入图片描述
//统计内置数据类型

//统计内置数据类型
class Greater
{
public:
	bool operator()(int val)
	{
		return val > 2;
	}
};

void test02()
{

	vector<int>v;
	v.push_back(0);
	v.push_back(3);
	v.push_back(1);
	v.push_back(3);
	v.push_back(2);
	v.push_back(3);
	v.push_back(3);


	int num = count_if(v.begin(), v.end(), Greater());
	cout << "大于2的元素个数为"<<num << endl;//4
	
}

//统计自定义数据类型

class Person
{
public:
	Person(string name, int age)
	{
		this->m_name = name;
		this->m_age = age;
	}

	
	
	string m_name;
	int m_age;
};

class Greater
{
public:
	bool operator()(const Person& p)
	{
		return p.m_age > 10;
	}
};


//统计自定义数据类型
void test01()
{
	vector<Person>v1;

	Person p1("qqq", 10);
	Person p2("rrr", 10);
	Person p3("ddd", 80);
	Person p4("fff", 90);
	
	v1.push_back(p1);
	v1.push_back(p2);
	v1.push_back(p3);
	v1.push_back(p4);

	

	int num = count_if(v1.begin(), v1.end(), Greater());
	cout << "年龄大于10的人数为" << num << endl;//2
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值