c++之STL(13) STL 算法 - 查找算法（5）adjacent_find(b,e) adjacent_find(b,e,p)

查找两个连续相等的或者是连续两个符合谓词规格的。

STL 查找算法

find()

find_if()

search_n()

search()

find_end()

find_first_of()

adjacent_find()

已序区间查找算法

binary_search()

includes()

lower_bound()

upper_bound()

#include<iostream>
#include<vector>
//#include<list>
//#include<string>
#include<algorithm>

using namespace std;

bool doubled(int elem1, int elem2)
{
	return elem1 *2 == elem2;
}

int main()
{
	vector<int> ivec;
	ivec.push_back(1);
	ivec.push_back(3);
	ivec.push_back(2);
	ivec.push_back(4);
	ivec.push_back(5);
	ivec.push_back(5);
	ivec.push_back(0);

	for (vector<int>::iterator iter = ivec.begin(); iter!=ivec.end(); iter++)
	{
		cout << *iter << ' ';
	}
	cout << endl;
	
	vector<int>::iterator pos;
	pos = adjacent_find(ivec.begin(), ivec.end());

	if (pos!=ivec.end())
	{
		cout << "找到了！位置：" << distance(ivec.begin(), pos) + 1 << endl;
	}
	else
		cout << "没找到！";

	pos = adjacent_find(ivec.begin(), ivec.end(), doubled);
	if (pos != ivec.end())
	{
		cout << "找到了，位置:"<<distance(ivec.begin(), pos) + 1 << endl;
	}
	else
		cout << "没找到！" << endl;
	//
	system("pause");
	return 0;
}