adjacent_find

最新推荐文章于 2024-11-06 11:05:01 发布

_泥巴_

最新推荐文章于 2024-11-06 11:05:01 发布

阅读量847

点赞数

文章标签： iterator vector algorithm function pair 算法

本文链接：https://blog.csdn.net/luchenqun/article/details/5659729

版权

Syntax:

    #include <algorithm>
    forward_iterator adjacent_find( forward_iterator start, forward_iterator end );
    forward_iterator adjacent_find( forward_iterator start, forward_iterator end, BinPred pr );

The adjacent_find() function searches between start and end for two consecutive identical elements. If the binary predicate pr is specified, then it is used to test whether two elements are the same or not. The return value is an iterator that points to the first of the two elements that are found. If no matching elements are found, the returned iterator points to end. For example, the following code creates a vector containing the integers between 0 and 10 with 7 appearing twice in a row. adjacent_find() is then used to find the location of the pair of 7's:

嗯，这个算法的主要意思就是：在一个数组中寻找两个相邻的元素。如果相等呢，就返回这两个相等元素第一个元素的迭代器，呵呵，不等的话，就返回v.end().

#include<algorithm> #include <iostream> #include<vector> using namespace std; int main() { int a[]={3,5,34,6,3,6,343,45,88,88,45,67,67}; vector<int> v(a,a+sizeof(a)/sizeof(a[0])); vector<int>::iterator result; result=adjacent_find(v.begin(),v.end()); if(result == v.end()) cout<<"Did not find adjacent elements in vector" << endl; if(result != v.end()) cout<<"Find adjancent elements is "<<*result<<endl; return 0; }

执行结果：

Find adjancent elements is 88