STL算法------查找5

1. adjacent_find(b, e)                 //找两个连续相等的

2. adjacent_find(b, e, p )

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

bool doubled( int val1, int val2 )
{
	return val1*2 == val2;
}

int main( int argc, char** argv )
{
	vector<int> vec;
	vec.insert( vec.end(), 1 );
	vec.insert( vec.end(), 3 );
	vec.insert( vec.end(), 2 );
	vec.insert( vec.end(), 4 );
	vec.insert( vec.end(), 5 );
	vec.insert( vec.end(), 5 );
	vec.insert( vec.end(), 0 );

	vector<int>::iterator pos;
	pos = adjacent_find(vec.begin(), vec.end());
	if( pos != vec.end() )
	{
		cout<<"find pos: "<<distance(vec.begin(), pos)+1<<endl;
	}else{
		cout<<"not find"<<endl;
	}

	pos = adjacent_find(vec.begin(), vec.end(), doubled);
	if( pos != vec.end() )
	{
		cout<<"find pos: "<<distance(vec.begin(), pos)+1<<endl;
	}else{
		cout<<"not find"<<endl;
	}

	

	return 0;
}