adjacent_find

最新推荐文章于 2025-08-14 11:49:44 发布

原创最新推荐文章于 2025-08-14 11:49:44 发布 · 872 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#iterator #vector #algorithm #function #pair #算法

本文介绍了C++标准库中的adjacent_find算法，该算法用于在序列中查找相邻且相等的元素对。通过示例代码展示了如何使用此算法来定位重复出现的元素，并解释了其返回值和使用场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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