C++之常用算法

C++之常用算法

for_each

transform

复制代码
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>

class Tranfor 
{
public:
	int operator()(int var)
	{
		return var;
	}
};

class MyPrint
{
public:
	void operator()(int var)
	{
		cout << var<<" " ;
	}
};
void test()
{
	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(),Tranfor());

	//遍历目标容器
	for_each(vTarget.begin(), vTarget.end(),MyPrint());
	cout << endl;
}

int main()
{
	test();

	system("pause");
	return 0;
}

常用查找算法

find

复制代码
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>
//查找内置数据类型

void test()
{
	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 test2()
{
	//定义容器
	vector<Person>v1;
	//创建数据(对象)
	Person p1("aaa", 20);
	Person p2("bbb", 30);
	Person p3("ccc", 40);
	Person p4("ddd", 50);

	//将数据放入容器
	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 << endl;
	}
}

int main()
{
	test2();

	system("pause");
	return 0;
}

find_if

复制代码
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>
//查找内置数据类型
class Greater
{
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(), Greater());
	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;
	}
	string m_Name;
	int m_Age;
};
class GreatAge
{
public:
	bool operator()(Person&p)
	{
		return p.m_Age > 20;
	}
};
void test2()
{
	//定义容器
	vector<Person>v1;
	//创建数据(对象)
	Person p1("aaa", 20);
	Person p2("bbb", 30);
	Person p3("ccc", 40);
	Person p4("ddd", 50);

	//将数据放入容器
	v1.push_back(p1);
	v1.push_back(p2);
	v1.push_back(p3);
	v1.push_back(p4);

	//查到对象数据
	vector<Person>::iterator it = find_if(v1.begin(), v1.end(), GreatAge());
	if (it == v1.end())
	{
		cout << "没有找到" << endl;
	}
	else
	{
		cout << "找到了  名字为:" << it->m_Name << "年龄为:" << it->m_Age << endl;
	}
}

int main()
{
	test2();

	system("pause");
	return 0;
}

adjacent_find

复制代码
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>

void test()
{
	vector<int>v;

	v.push_back(9);
	v.push_back(3);
	v.push_back(4);
	v.push_back(5);
	v.push_back(5);

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


int main()
{
	test();

	system("pause");
	return 0;
}
复制代码
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>

void test()
{
	vector<int>v;
	for (int i = 0;i < 10;i++)
	{
		v.push_back(i);
	}
	//注意:容器必须是有序的序列
	bool rat =  binary_search(v.begin(), v.end(), 9);
	if (rat == true)
	{
		cout << "找到了" << endl;
	}
	else
	{
		cout << "没有找到" << endl;
	}
}


int main()
{
	test();

	system("pause");
	return 0;
}

count

复制代码
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>

void test()
{
	vector<int>v;
	v.push_back(30);
	v.push_back(50);
	v.push_back(30);
	v.push_back(20);
	v.push_back(50);

	int num = count(v.begin(), v.end(), 50);
	
	cout << "找到元素50" << num << 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 test2()
{
	//定义容器
	vector<Person>v1;
	//创建数据(对象)
	Person p1("aaa", 20);
	Person p2("bbb", 30);
	Person p3("ccc", 40);
	Person p4("ddd", 50);

	//将数据放入容器
	v1.push_back(p1);
	v1.push_back(p2);
	v1.push_back(p3);
	v1.push_back(p4);

	//查到对象数据
	Person p5("ddd", 50);
	int num = count(v1.begin(), v1.end(), p5);
	cout << "和ddd同岁的人" << num << endl;
}
int main()
{
	test2();

	system("pause");
	return 0;
}


count_if

复制代码
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>
class Greater
{
public:
	bool operator()(int val)
	{
		return val > 40;
	}
};
void test()
{
	vector<int>v;
	v.push_back(30);
	v.push_back(50);
	v.push_back(30);
	v.push_back(20);
	v.push_back(50);

	int num = count_if(v.begin(), v.end(), Greater());
	
	cout << "找到大于40的个数" << 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 GreatAge
{
public:
	bool operator()(Person& p)
	{
		return p.m_Age > 20;
	}
};
void test2()
{
	//定义容器
	vector<Person>v1;
	//创建数据(对象)
	Person p1("aaa", 20);
	Person p2("bbb", 30);
	Person p3("ccc", 40);
	Person p4("ddd", 50);

	//将数据放入容器
	v1.push_back(p1);
	v1.push_back(p2);
	v1.push_back(p3);
	v1.push_back(p4);

	int num = count_if(v1.begin(), v1.end(), GreatAge());
	cout << "岁数大于20的个数" << num << endl;
}
int main()
{
	test2();

	system("pause");
	return 0;
}
相关推荐
Y1nhl8 分钟前
力扣_链表_python版本
开发语言·python·算法·leetcode·链表·职场和发展
qq_4017004123 分钟前
C语言中位运算以及获取低8位和高8位、高低位合并
c语言·开发语言·算法
CoovallyAIHub27 分钟前
YOLO模型优化全攻略:从“准”到“快”,全靠这些招!
深度学习·算法·计算机视觉
闻缺陷则喜何志丹32 分钟前
【BFS】 P10864 [HBCPC2024] Genshin Impact Startup Forbidden II|普及+
c++·算法·宽度优先·洛谷
MicroTech20251 小时前
微算法科技(NASDAQ: MLGO)探索Grover量子搜索算法,利用量子叠加和干涉原理,实现在无序数据库中快速定位目标信息的效果。
数据库·科技·算法
qianbo_insist1 小时前
c++ python 共享内存
开发语言·c++·python
今天背单词了吗9801 小时前
算法学习笔记:8.Bellman-Ford 算法——从原理到实战,涵盖 LeetCode 与考研 408 例题
java·开发语言·后端·算法·最短路径问题
手握风云-1 小时前
优选算法的链脉之韵:链表专题
数据结构·算法·链表
Coding小公仔2 小时前
LeetCode 151. 反转字符串中的单词
开发语言·c++·算法