adjacent_find()搜寻两个继续相等的元素

#include "algostuff.hpp"
using namespace std;
bool doubled(int elem1,int elem2)
{
 return elem1*2==elem2;
}
int main()
{
 vector<int> coll;
 coll.push_back(1);
 coll.push_back(3);
 coll.push_back(2);
 coll.push_back(4);
 coll.push_back(5);
 coll.push_back(5);
 coll.push_back(0);

 PRINT_ELEMENTS(coll,"coll: ");
 vector<int>::iterator pos;
 pos=adjacent_find(coll.begin(),coll.end());
 if(pos!=coll.end())
 {
  cout<<"first two elements with equal value have position "
   <<distance(coll.begin(),pos)+1
   <<endl;
 }

 pos=adjacent_find(coll.begin(),coll.end(),doubled);
 if(pos!=coll.end())
 {
  cout<<"first two elements with second value twice the first have pos. "
   <<distance(coll.begin(),pos)+1
   <<endl;
 }
}

////////////////////////////////////////////////////////////////////////////////////////////////

output:

coll: 1 3 2 4 5 5 0
first two elements with equal value have position 5
first two elements with second value twice the first have pos. 3
Press any key to continue 

转载于:https://www.cnblogs.com/qnbs1/articles/1714390.html