Linux C++ 037-STL之查找算法

Linux C++ 037-STL之查找算法

本节关键字：Linux、C++、查找算法
相关库函数：find、find_if、adjacent_find

find()

功能描述：查找指定元素，找到，返回指定元素的迭代器，找不到，返回结束迭代器end()
函数原型：

iterator find(iterator beg, iterator end, value);
//beg - 开始迭代器
//end - 结束迭代器
//value - 查找的元素

示例：

#include <algorithm>
#include <vector>
#include <string>

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 p1("bbb", 20);
    Person p1("ccc", 30);
    Person p1("ddd", 40);
    
    v.push_back(p1);
    v.push_back(p2);
    v.push_back(p3);
    v.push_back(p4);
    
    Person pp("bbb", 20);
    
    vector<Person>::iterator it = find(v.begin(), v.end(), pp);
    if(it == v.end())
    {
        cout << "没有找到目标元素" << endl;
    }
    else
    {
        cout << "找到目标元素：" << it->m_Name << it->m_Age << endl;
    }
    
}

总结：利用find可以在容器中找到指定的元素，返回值是迭代器

find_if()

功能描述：按条件查找元素
函数原型：

iterator find_if(iterator beg, iterator end, _Pred);
/*
beg -- 开始迭代器
end -- 结束迭代器
_Pred - 函数或者谓词（返回bool类型的仿函数）
*/

示例：

#include <algorithm>
#include <vector>
#include <string>

class GreaterFive
{
public:
    bool operator()(int v)
    {
        rerturn v > 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 << "找到大于五的元素：" << *it << endl;
    }
    else
    {
        cout << "没有找到大于五的元素" << endl;
    }
    
}

//查找自定义数据类型
class Person
{
public:
    Person(string name, int age)
    {
        this->m_Name = name;
        this->m_Age = age;
    }
    
    string m_Name;
    int m_Age;
};
//谓词
class GreaterSix
{
public:
    bool operator()(Person &p)
    {
        return p.m_Age > 6;
    }
};


void test02()
{
    vector<Person> v;
    
    Person p1("a", 10);
    Person p2("b", 20);
    Person p3("c", 30);
    Person p4("d", 40);
    
    v.push_back(p1);
    v.push_back(p2);
    v.push_back(p3);
    v.push_back(p4);
    
    vector<Person>::iterator it = find_if(v.begin(), v.end(), GreaterSix());
    if(it != v.end())
    {
        cout << "找到大于六的元素：" << endl;
    }
    else
    {
        cout << "没有找到大于六的元素" << "姓名：" << it->m_name << endl;
    }
}

adjacent_find()

功能描述：查找相邻重复元素
函数原型：

iterator adjacent_find(iterator beg, iterator end);
/*
查找相邻重复元素，返回相邻元素的第一个位置的迭代器
beg -- 开始迭代器
end -- 结束迭代器
*/

示例：

#include <iostream>
#include <vector>
#include <algorithm>

void test01()
{
    vector<int> c;
    c.push_back(1);
    c.push_back(2);
    c.push_back(3);
    c.push_back(3);
    c.push_back(1);
    
    vector<int>::iterator pos = adjacent_find(v.begin(0, v.end());
    if(pos == v.end())
    {
        cout << "未找到" << endl;
    }
    else
    {
        cout << "找到相邻重复元素" << *pos << endl;
    }
}

binary_search()

功能描述：查找指定元素是否存在
函数原型：

bool binary_search(iterator beg, iterator end, value);
/*
查找指定的元素，查到 返回true，否则返回false
注意：在无序序列中不可用
beg -- 开始迭代器
end -- 结束迭代器
value - 查找的元素
*/

示例：

#include <iostream>
#include <vector>
#include <algorithm>

void test01()
{
    vector<int> v;
    for(int i=0;i<10;i++)
    {
        v.push_back(i);
    }
    
    bool pos = bianry_search(v.begin(), v.end(), 6);
    if(pos)
    {
        cout << "找到了" << endl;
    }
    else
    {
        cout << "未找到" << endl;
    }
}

注意：在无序序列中， binary_search()不可用
总结：二分查找法效率很高，值得注意的是查找的容器中元素必须是有序的序列

count()

函数功能：统计元素个数
函数原型：

int count(itoerator beg, ierator end, value);
/*
统计元素出现次数
beg -- 开始迭代器
end -- 结束迭代器
value - 统计的元素
*/

示例：

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>

void test01()
{
    vector<int> v;
    v.push_back(10);
    v.push_back(20);
    v.push_back(30);
    v.push_back(40);
    v.push_back(40);
    v.push_back(40);
    
    int num = count(v.brgin(), v.end(), 40);
    cout << "40的个数为" << num << endl;
}

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()
{
    Person p1 = ("a", 10);
    Person p2 = ("b", 20);
    Person p3 = ("c", 30);
    Person p4 = ("d", 20);
    Person p5 = ("e", 50);
    
    vector<Person> v;
    v.push_back(p1);
    v.push_back(p2);
    v.push_back(p3);
    v.push_back(p4);
    v.push_back(p5);
    
    Person p("f", 20);
    
    int num = count(v.begin(), v.end(), p);
    cout << "和p的年龄同岁数的人数为" << num << endl;
}

count_if()

功能描述：按条件统计元素个数
函数原型：

int count_if(iterator beg, iterator end, _Pred);
/*
按条件统计元素出现次数
beg -- 开始迭代器
end -- 结束迭代器
_Pred - 谓词
*/

示例：

#include <iostream>
#include <vector>
#include <algorithm>

class Greater4
{
public:
    bool operator()(int val)
    {
        return val >= 4;
    }
};
void test01()
{
    vector<int> v;
    for(int i=0;i<10;i++)
    {
        vector.push_back(i);
    }
    
    int num = count_if(v.begin(), v.end(), Greater4);
    cout << "大于4的个数为：" << 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 Greater18
{
public:
    bool operator()(const Person &p)
    {
        return p.m_Age >= 18;
    }
}
void test02()
{
    vector<Person> v;
    
    Person p1("a", 15);
    Person p2("b", 16);
    Person p3("c", 17);
    Person p4("d", 18);
    Person p5("e", 19);
    
    v.push_back(p1);
    v.push_back(p2);
    v.push_back(p3);
    v.push_back(p4);
    v.push_back(p5);
    
    int num = count_if(v.begin(), v.end(), Greater18);
    count << "年龄大于17的人数为：" << num << endl;
}