概述
算法主要是由头文件组成。
是所有STL头文件中最大的一个,范围涉及到比较、 交换、查找、遍历操作、复制、修改等等。
体积很小,只包括几个在序列上面进行简单数学运算的模板函数定义了一些模板类,用以声明函数对象。
1、常用遍历算法
掌握常用的遍历算法的函数模型:
函数原型 | 功能 | 参数说明 |
---|---|---|
for_each(iterator beg, iterator end, _func); | 遍历算法,遍历容器元素。 | beg 开始迭代器, end 结束迭代器, _func 函数或者函数对象 |
transform(iterator beg1, iterator end1, iterator beg2, _func); | 搬运容器到另一个容器中。 | beg1 源容器开始迭代器, end1 源容器结束迭代器, beg2 目标容器开始迭代器, _func 函数或者函数对象 |
for_each示例:
#include <algorithm>
#include <vector>
//普通函数
void print01(int val)
{
cout << val << " ";
}
//函数对象
class print02
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
//for_each算法基本用法
void test01() {
vector<int> v;
for (int i = 0; i < 10; i++)
{
v.push_back(i);
}
//遍历算法
for_each(v.begin(), v.end(), print01);
cout << endl;
for_each(v.begin(), v.end(), print02());
cout << endl;
}
int main() {
test01();
system("pause");
return 0;
}
transform示例:
#include<vector>
#include<algorithm>
//常用遍历算法 搬运 transform
class TransForm
{
public:
int operator()(int val)
{
return val;
}
};
class MyPrint
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
void test01()
{
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(), TransForm());
for_each(vTarget.begin(), vTarget.end(), MyPrint());
}
int main() {
test01();
system("pause");
return 0;
}
2、常用查找算法
掌握常用的查找算法的函数模型:
函数模型 | 功能 | 参数说明 |
---|---|---|
find(iterator beg, iterator end, value); | 按值查找元素,找到返回指定位置迭代器,找不到返回结束迭代器位置。 | beg 开始迭代器, end 结束迭代器, value 查找的元素 |
find_if(iterator beg, iterator end, _Pred); | 按值查找元素,找到返回指定位置迭代器,找不到返回结束迭代器位置。 | beg 开始迭代器, end 结束迭代器, value 查找的元素,_Pred 函数或者谓词(返回bool类型的仿函数) |
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>
//常用查找算法:find
//1. 查找内置数据类型
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 << "未找到等于5的元素!" << endl;
}
else
{
cout << "找到等于5的元素:" << *it << endl;
}
}
//2. 查找自定义数据类型(必须重载==)
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);
//查找容器中是否有p2这个人
vector<Person>::iterator it = find(v.begin(), v.end(), p2);
if (it == v.end())
{
cout << "未找到p2!" << endl;
}
else
{
cout << "找到p2!姓名:" << it->m_Name << " 年龄:" << it->m_Age << endl;
}
}
int main()
{
test01();
test02();
system("pause");
return 0;
}
find_if示例:
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>
//常用查找算法:find_if
//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);
}
//查找容器中是否有大于5的元素
vector<int>::iterator it = find_if(v.begin(), v.end(), GreaterFive());
if (it == v.end())
{
cout << "未找到大于5的元素!" << endl;
}
else
{
cout << "找到大于5的元素:" << *it << endl;
}
}
//2. 查找自定义数据类型(必须重载==)
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;
};
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 << "未找到年龄大于20的人!" << endl;
}
else
{
cout << "找到年龄大于20的人!姓名:" << it->m_Name << " 年龄:" << it->m_Age << endl;
}
}
int main()
{
test01();
test02();
system("pause");
return 0;
}
adjacent_find示例:
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>
//常用查找算法:adjacent_find
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 it = adjacent_find(v.begin(), v.end());
if (it == v.end())
{
cout << "未找到相邻重复元素!" << endl;
}
else
{
cout << "找到相邻重复元素:" << *it << endl;
}
}
int main()
{
test01();
system("pause");
return 0;
}
binary_search示例:
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>
//常用查找算法:binary_search
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); //注意:binary_search使用时,容器必须是有序序列
if (ret)
{
cout << "找到等于9的元素!" << endl;
}
else
{
cout << "未找到等于9的元素!" << endl;
}
}
int main()
{
test01();
system("pause");
return 0;
}
count示例:
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>
//常用查找算法:count
//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;
}
count_if示例:
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>
//常用查找算法:count_if
//1. 统计内置数据类型
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);
//统计大于20的元素的个数
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;
}
string m_Name;
int m_Age;
};
class AgeGreater20
{
public:
bool operator()(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("曹操", 20);
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;
}
3、常用排序算法
掌握常用的排序算法的函数原型:
函数原型 | 功能 |
---|---|
sort(iterator beg, iterator end, _Pred); | 对容器内元素进行排序。 |
random_shuffle(iterator beg, iterator end); | 指定范围内的元素随机调整次序。 |
merge(iterator beg1, iterator end1, iterator beg2, iterator end2, iterator dest); | 容器元素合并,并存储到另一容器中。 |
reverse(iterator beg, iterator end); | 反转指定范围的元素。 |
#include <algorithm>
#include <vector>
void myPrint(int val)
{
cout << val << " ";
}
void test01() {
vector<int> v;
v.push_back(10);
v.push_back(30);
v.push_back(50);
v.push_back(20);
v.push_back(40);
//sort默认从小到大排序
sort(v.begin(), v.end());
for_each(v.begin(), v.end(), myPrint);
cout << endl;
//从大到小排序
sort(v.begin(), v.end(), greater<int>());
for_each(v.begin(), v.end(), myPrint);
cout << endl;
}
int main() {
test01();
system("pause");
return 0;
}
random_shuffle示例:
#include <algorithm>
#include <vector>
#include <ctime>
class myPrint
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
void test01()
{
srand((unsigned int)time(NULL));
vector<int> v;
for(int i = 0 ; i < 10;i++)
{
v.push_back(i);
}
for_each(v.begin(), v.end(), myPrint());
cout << endl;
//打乱顺序
random_shuffle(v.begin(), v.end());
for_each(v.begin(), v.end(), myPrint());
cout << endl;
}
int main() {
test01();
system("pause");
return 0;
}
merge示例:
#include <algorithm>
#include <vector>
class myPrint
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
void test01()
{
vector<int> v1;
vector<int> v2;
for (int i = 0; i < 10 ; i++)
{
v1.push_back(i);
v2.push_back(i + 1);
}
vector<int> vtarget;
//目标容器需要提前开辟空间
vtarget.resize(v1.size() + v2.size());
//合并 需要两个有序序列
merge(v1.begin(), v1.end(), v2.begin(), v2.end(), vtarget.begin());
for_each(vtarget.begin(), vtarget.end(), myPrint());
cout << endl;
}
int main() {
test01();
system("pause");
return 0;
}
reverse示例:
#include <algorithm>
#include <vector>
class myPrint
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
void test01()
{
vector<int> v;
v.push_back(10);
v.push_back(30);
v.push_back(50);
v.push_back(20);
v.push_back(40);
cout << "反转前: " << endl;
for_each(v.begin(), v.end(), myPrint());
cout << endl;
cout << "反转后: " << endl;
reverse(v.begin(), v.end());
for_each(v.begin(), v.end(), myPrint());
cout << endl;
}
int main() {
test01();
system("pause");
return 0;
}
4、常用拷贝和替换算法
掌握常用的拷贝和替换算法的函数模型:
函数模型 | 功能 | 参数说明 |
---|---|---|
copy(iterator beg, iterator end, iterator dest); | 容器内指定范围的元素拷贝到另一容器中。 | beg 容器开始迭代器, end 容器结束迭代器,dest 目标容器开始迭代器 |
replace(iterator beg, iterator end, oldvalue, newvalue); | 将区间内旧元素替换成新元素。 | beg 开始迭代器, end 结束迭代器, oldvalue 旧的元素,newvalue 新的元素 |
replace_if(iterator beg, iterator end, _pred, newvalue); | 按条件替换元素,满足条件的替换成指定元素。 | beg 开始迭代器, end 结束迭代器,_Pred 函数或者谓词(返回bool类型的仿函数),value 替换的新元素 |
swap(container c1, container c2); | 互换两个容器的元素。 | c1 容器1,c2容器2 |
copy示例:
#include <algorithm>
#include <vector>
class myPrint
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
void test01()
{
vector<int> v1;
for (int i = 0; i < 10; i++) {
v1.push_back(i + 1);
}
vector<int> v2;
v2.resize(v1.size());
copy(v1.begin(), v1.end(), v2.begin());
for_each(v2.begin(), v2.end(), myPrint());
cout << endl;
}
int main() {
test01();
system("pause");
return 0;
}
replace示例:
#include <algorithm>
#include <vector>
class myPrint
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
void test01()
{
vector<int> v;
v.push_back(20);
v.push_back(30);
v.push_back(20);
v.push_back(40);
v.push_back(50);
v.push_back(10);
v.push_back(20);
cout << "替换前:" << endl;
for_each(v.begin(), v.end(), myPrint());
cout << endl;
//将容器中的20 替换成 2000
cout << "替换后:" << endl;
replace(v.begin(), v.end(), 20,2000);
for_each(v.begin(), v.end(), myPrint());
cout << endl;
}
int main() {
test01();
system("pause");
return 0;
}
replace_if示例:
#include <algorithm>
#include <vector>
class myPrint
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
class ReplaceGreater30
{
public:
bool operator()(int val)
{
return val >= 30;
}
};
void test01()
{
vector<int> v;
v.push_back(20);
v.push_back(30);
v.push_back(20);
v.push_back(40);
v.push_back(50);
v.push_back(10);
v.push_back(20);
cout << "替换前:" << endl;
for_each(v.begin(), v.end(), myPrint());
cout << endl;
//将容器中大于等于的30 替换成 3000
cout << "替换后:" << endl;
replace_if(v.begin(), v.end(), ReplaceGreater30(), 3000);
for_each(v.begin(), v.end(), myPrint());
cout << endl;
}
int main() {
test01();
system("pause");
return 0;
}
swap示例:
#include <algorithm>
#include <vector>
class myPrint
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
void test01()
{
vector<int> v1;
vector<int> v2;
for (int i = 0; i < 10; i++) {
v1.push_back(i);
v2.push_back(i+100);
}
cout << "交换前: " << endl;
for_each(v1.begin(), v1.end(), myPrint());
cout << endl;
for_each(v2.begin(), v2.end(), myPrint());
cout << endl;
cout << "交换后: " << endl;
swap(v1, v2);
for_each(v1.begin(), v1.end(), myPrint());
cout << endl;
for_each(v2.begin(), v2.end(), myPrint());
cout << endl;
}
int main() {
test01();
system("pause");
return 0;
}
5、常用算术生成算法
掌握常用的算术生成算法的函数模型:
函数模型 | 功能 | 参数说明 |
---|---|---|
copy(iterator beg, iterator end, iterator dest); | 容器内指定范围的元素拷贝到另一容器中。 | beg 容器开始迭代器, end 容器结束迭代器,dest 目标容器开始迭代器 |
replace(iterator beg, iterator end, oldvalue, newvalue); | 将区间内旧元素替换成新元素。 | beg 开始迭代器, end 结束迭代器, oldvalue 旧的元素,newvalue 新的元素 |
replace_if(iterator beg, iterator end, _pred, newvalue); | 按条件替换元素,满足条件的替换成指定元素。 | beg 开始迭代器, end 结束迭代器,_Pred 函数或者谓词(返回bool类型的仿函数),value 替换的新元素 |
swap(container c1, container c2); | 互换两个容器的元素。 | c1 容器1,c2容器2 |
accumulate示例:
#include<iostream>
using namespace std;
#include<string>
#include <vector>
#include<algorithm>
#include<numeric>//算术生成算法
void test01()
{
vector<int>v1;
for (int i = 0; i < 100; i++)
{
v1.push_back(i);
}
int total1 = accumulate(v1.begin(), v1.end(), 1000);
cout << "total1: " << total1 << endl;
int total2 = accumulate(v1.begin(), v1.end(), 0);
cout << "total2: " << total2 << endl;
}
int main()
{
test01();
system("pause");
return 0;
}
fill示例:
#include<iostream>
using namespace std;
#include <vector>
#include<algorithm>
class MyPrint
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
void test01()
{
vector<int>v1;
v1.resize(10);
fill(v1.begin(), v1.end(), 100);
for_each(v1.begin(), v1.end(), MyPrint());
cout << endl;
}
int main()
{
test01();
system("pause");
return 0;
}
6、常用集合算法
掌握常用的集合算法的函数模型:
函数模型 | 功能 | 参数说明 |
---|---|---|
set_intersection(iterator beg1, iterator end1, iterator beg2, iterator end2, iterator dest); | 求两个集合的交集。 | beg1 容器1开始迭代器,end1 容器1结束迭代器,beg2 容器2开始迭代器,end2 容器2结束迭代器,dest 目标容器开始迭代器 |
set_union(iterator beg1, iterator end1, iterator beg2, iterator end2, iterator dest); | 求两个集合的并集。 | beg1 容器1开始迭代器,end1 容器1结束迭代器,beg2 容器2开始迭代器,end2 容器2结束迭代器,dest 目标容器开始迭代器 |
set_difference(iterator beg1, iterator end1, iterator beg2, iterator end2, iterator dest); | 求两个集合的差集。 | beg1 容器1开始迭代器,end1 容器1结束迭代器,beg2 容器2开始迭代器,end2 容器2结束迭代器,dest 目标容器开始迭代器 |
set_intersection示例:
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;
class myPrint
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
void test01()
{
vector<int>v1;
vector<int>v2;
for (int i = 0; i < 10; i++)
{
v1.push_back(i);
v2.push_back(i + 5);
}
for_each(v1.begin(), v1.end(), myPrint());
cout << endl;
for_each(v2.begin(), v2.end(), myPrint());
cout << endl;
vector<int >v3;
v3.resize(min(v1.size(),v2.size()));
vector<int>::iterator itEnd = set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin());
for_each(v3.begin(), itEnd, myPrint());
cout << endl;
}
int main()
{
test01();
return 0;
}
set_union示例:
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;
class myPrint
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
void test01()
{
vector<int>v1;
vector<int>v2;
for (int i = 0; i < 10; i++)
{
v1.push_back(i);
v2.push_back(i + 5);
}
for_each(v1.begin(), v1.end(), myPrint());
cout << endl;
for_each(v2.begin(), v2.end(), myPrint());
cout << endl;
vector<int >v3;
v3.resize(v1.size() + v2.size());
vector<int>::iterator itEnd = set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin());
for_each(v3.begin(), itEnd, myPrint());
cout << endl;
}
int main()
{
test01();
return 0;
}
set_difference示例:
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;
class myPrint
{
public:
void operator()(int val)
{
cout << val << " ";
}
};
void test01()
{
vector<int>v1;
vector<int>v2;
for (int i = 0; i < 10; i++)
{
v1.push_back(i);
v2.push_back(i + 5);
}
for_each(v1.begin(), v1.end(), myPrint());
cout << endl;
for_each(v2.begin(), v2.end(), myPrint());
cout << endl;
vector<int >v3;
v3.resize(max(v1.size() , v2.size()));
//v1和v2的差集
vector<int>::iterator itEnd = set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin());
for_each(v3.begin(), itEnd, myPrint());
cout << endl;
cout << "---------------------------------------" << endl;
//v2和v1的差集
vector<int>::iterator itEnd02 = set_difference(v2.begin(), v2.end(), v1.begin(), v1.end(), v3.begin());
for_each(v3.begin(), itEnd02, myPrint());
cout << endl;
}
int main()
{
test01();
return 0;
}