STL-常用查找方法find

find

#include<iostream>
using namespace std;
#include<vector>
#include<string>
#include<algorithm>
//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 << "no" << endl;
	}
	else
	{
		cout << "yes" << endl;
		cout << *it << endl;
	}
}
class Person
{
public:
	Person(string name, int age)
	{
		this->m_age = age;
		this->m_name = name;
	}
	string m_name;
	int m_age;
};
//查找自定义数据类型
void test02()
{
	vector<Person>v;
	//
	Person p1("asfa", 10);
	Person p2("aerith", 20);
	Person p3("kallen", 30);
	Person p4("tifa", 40);
	Person p5("ada", 50);

	//
	v.push_back(p1);
	v.push_back(p2);
	v.push_back(p3);
	v.push_back(p4);
	v.push_back(p5);
	//
	vector<Person>::iterator it = find(v.begin(), v.end(), p2);
	if (it == v.end())
	{
		cout << "no" << endl;
	}
	else
	{
		cout << "yes!" << endl;
		cout << it->m_name << " " << it->m_age << endl;
	}
}


void main()
{
	/*test01();*/
	test02();
}

find函数底层是"==", 编译器不知道如何判断Person类型的相等, 必须在Person类里面重载==

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

	bool operator==(const Person &p1)//这次const写里面了...
	{
		if (this->m_age == p1.m_age && this->m_name == p1.m_name)
		{
			return true;
		}
		else
			return false;
	}
	string m_name;
	int m_age;
};

全代码:

#include<iostream>
using namespace std;
#include<vector>
#include<string>
#include<algorithm>
//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 << "no" << endl;
	}
	else
	{
		cout << "yes" << endl;
		cout << *it << endl;
	}
}
class Person
{
public:
	Person(string name, int age)
	{
		this->m_age = age;
		this->m_name = name;
	}

	bool operator==(const Person &p1)//这次const写里面了...
	{
		if (this->m_age == p1.m_age && this->m_name == p1.m_name)
		{
			return true;
		}
		else
			return false;
	}
	string m_name;
	int m_age;
};
//查找自定义数据类型
void test02()
{
	vector<Person>v;
	//
	Person p1("asfa", 10);
	Person p2("aerith", 20);
	Person p3("kallen", 30);
	Person p4("tifa", 40);
	Person p5("ada", 50);

	//
	v.push_back(p1);
	v.push_back(p2);
	v.push_back(p3);
	v.push_back(p4);
	v.push_back(p5);
	//
	vector<Person>::iterator it = find(v.begin(), v.end(), p2);//返回值是迭代器
	if (it == v.end())
	{
		cout << "no" << endl;
	}
	else
	{
		cout << "yes!" << endl;
		cout << it->m_name << " " << it->m_age << endl;
	}
}


void main()
{
	/*test01();*/
	test02();
}

  • 8
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

青樱部_OFFICIAL

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值