分类
1
find(iterator beg,iterator end,value)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<int> v1;
for(int i=0;i<10;i++)
v1.push_back(i);
vector<int>::iterator it=find(v1.begin(),v1.end(),2);
if(it!=v1.end())
{
cout << "找到了" <<endl;
}
else cout << "没找到" << endl;
return 0;
}
2
adjacent_find(iterator beg,iterator end)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<int> v1;
for(int i=0;i<10;i++)
v1.push_back(i);
v1.push_back(9);
vector<int>::iterator it = adjacent_find(v1.begin(),v1.end());
if(it!=v1.end())
{
cout << "找到了:" << *it<<endl;
}
else cout << "没找到"<< endl;
return 0;
}
3
bool binary_search(iterator beg, iterator end,value)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
vector<int> v1;
for(int i=0;i<10;i++)
v1.push_back(i);
v1.push_back(9);
bool it=binary_search(v1.begin(),v1.end(),8);
if(it!=0)
{
cout << "找到了" <<endl;
}
else cout << "没找到"<< endl;
return 0;
}
4
find_if(iterator beg, iterator end,value,MYif)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool Mysearch(int val)
{
return val>5;
}
int main()
{
vector<int> v1;
for(int i=0;i<10;i++)
v1.push_back(i);
v1.push_back(9);
vector<int>::iterator it=find_if(v1.begin(),v1.end(),Mysearch);
if(it!=v1.end()){
cout << "找到了:" << *it << endl;
}
else{
cout << "没有找到!" << endl;
}
return 0;
}
5
count(iterator beg, iterator end,value,value)
count(iterator beg, iterator end,value,MYif)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool Mysearch(int val)
{
return val>5;
}
int main()
{
vector<int> v1;
for(int i=0;i<10;i++)
v1.push_back(i);
v1.push_back(9);
int n=count(v1.begin(),v1.end(),9);
cout << "9出现的次数为:" << n << endl;
return 0;
}
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool Mysearch(int val)
{
return val>5;
}
int main()
{
vector<int> v1;
for(int i=0;i<10;i++)
v1.push_back(i);
v1.push_back(9);
int n =count_if(v1.begin(),v1.end(),Mysearch);
cout << "满足条件的次数为:" << n << endl;
return 0;
}