#include<iostream>
#include<string>
#include<deque>
#include<list>
#include<algorithm>
#include<vector>
using namespace std;
//查连续的数据是否存在
//二元谓词做阐参数
bool checkEven(int elem, bool even)
{
if (even)
return elem%2 == 0;
else
return elem%2 == 1;
}
int main()
{
deque<int> ideq;
list<int> ilist;
for (int i = 1; i <= 7; ++i)
ideq.insert(ideq.end(), i);
for (int i = 1; i <= 7; ++i)
ideq.insert(ideq.end(), i);
for (int i = 2; i <= 6; ++i)
ilist.insert(ilist.end(), i);
for (deque<int>::iterator iter = ideq.begin();
iter != ideq.end(); ++iter)
cout << *iter << " ";
cout << endl;
//deque<int>::iterator pos;
//pos = search(ideq.begin(), ideq.end(), ilist.begin(), ilist.end());//在前边序列里找后端序列的值
//if (pos != ideq.end())
//{
// cout << "find ok:位置是:" << distance(ideq.begin(), pos) + 1 << endl;
//}
//++pos;//从2之后开始找,不然又找的第一个23~
//pos = search(pos, ideq.end(), ilist.begin(), ilist.end());
//if (pos != ideq.end())
//{
// cout << "find ok:位置是:" << distance(ideq.begin(), pos) + 1 << endl;
//}
////变一下形式
//while (pos != ideq.end())
//{
// cout << "find ok:位置是:" << distance(ideq.begin(), pos) + 1 << endl;
// ++pos;
// pos = search(pos, ideq.end(), ilist.begin(), ilist.end());
//}
////使用find——end进行查找
//pos = find_end(ideq.begin(), ideq.end(), ilist.begin(), ilist.end());
//if (pos != ideq.end())
// cout << "find ok:位置是:" << distance(ideq.begin(), pos) + 1 << endl;
//使用谓词来进行更复杂的查找
vector<int> ivec;
for (int i = 0; i <= 7; ++i)
ivec.push_back(i);
bool checkEvenArgs[3] = {true, false, true};//偶数,奇数,偶数
vector<int>::iterator pos6;
pos6 = search(ivec.begin(), ivec.end(),checkEvenArgs,checkEvenArgs+3, checkEven);
//数组的名称实际上是一个指针,他指向数组的第一个元素。
if (pos6 != ivec.end())
cout << "find ok:位置是:" << distance(ivec.begin(), pos6) + 1 << endl;
else
cout << "find error" << endl;
system("pause");
return 0;
}
查找-3
猜你喜欢
转载自blog.csdn.net/weixin_42655231/article/details/82796039
今日推荐
周排行