adjacent_find

最新推荐文章于 2024-06-06 13:32:23 发布

原创最新推荐文章于 2024-06-06 13:32:23 发布 · 602 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#stl

stl 专栏收录该内容

22 篇文章

订阅专栏

本文详细解释了C++中用于寻找相邻元素的`adjacent_find`函数，包括其工作原理、使用方法及两个实例代码演示。

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

Protype of function is

template<class ForwardIterator>
   ForwardIterator adjacent_find(
      ForwardIterator _First, 
      ForwardIterator _Last
      );
template<class ForwardIterator , class BinaryPredicate>
   ForwardIterator adjacent_find(
      ForwardIterator _First, 
      ForwardIterator _Last, 
            BinaryPredicate _Comp
   );

One example,

#include <algorithm>
#include <list>
#include <iostream>

using namespace std;

int main(){
	list<int> iList;
	iList.push_back(3);
	iList.push_back(6);
	iList.push_back(9);
	iList.push_back(11);
	iList.push_back(11);
	iList.push_back(18);
	iList.push_back(20);
	iList.push_back(20);

	list<int>::iterator iter;
	for(iter = iList.begin(); iter != iList.end(); ++iter){
		cout << *iter << "  ";
	}
	cout << endl;

	list<int>::iterator iResult = adjacent_find(iList.begin(), iList.end());
	if (iResult != iList.end()){
		cout << "链表中第一对相等的邻近元素为：" << endl;
		cout << *iResult++ << endl;
		cout << *iResult << endl;
	}

	iResult = adjacent_find(iList.begin(), iList.end(), [](int x, int y){return (x - y) % 2 == 0 ? 1 : 0;});
	if (iResult != iList.end()){
		cout << "First pair with same parity：" << endl;
		cout << *iResult++ << endl;
		cout << *iResult << endl;
	}
	return 0;
}

Note that *iResult++, first outputs *iResult, then add one to iResult.