#include <iostream>
using namespace std;
#include <vector>
#include <algorithm>
void test()
{
vector<int> v;
v.push_back(0);
v.push_back(1);
v.push_back(3);
v.push_back(2);
v.push_back(2);
v.push_back(4);
v.push_back(4);
v.push_back(5);
vector<int>::iterator it = adjacent_find(v.begin(), v.end());
if (it == v.end())
{
cout << "没有查到" << endl;
}
else
{
cout << *it << endl;
}
}
int main()
{
test();
return 0;
}