search_n
原型:Iterator search_n (Iterator begin, Iterator end, Size count, const T& value)
Iterator search_n (Iterator begin, Iterator end, Size count, const T& value,BinaryPredicate op)
功能:搜索前n个连续匹配的值
vector<
int
>::iterator pos_search_n_1,pos_search_n_2;
// 搜索vector 中连续两个值为2的起始位置
pos_search_n_1= search_n(myvector2.begin(), myvector2.end(), 2, 2);
// 搜索vector 中连续值大于2的起始位置
pos_search_n_2 = search_n(myvector2.begin(), myvector2.end(),4,4,greater<
int
>());
if
(pos_search_n_1 != myvector2.end())
{
cout <<
"2个连续大于2的值的起始位置是: "
<< distance(myvector2.begin(), pos_search_n_1) + 1 << endl;
}
else
{
cout <<
"没有找到符合要求的元素"
<< endl;
}
if
(pos_search_n_2 != myvector2.end())
{
cout <<
"4个连续大于4的值的起始位置是: "
<< distance(myvector2.begin(), pos_search_n_2) + 1 << endl;
}
else
{
cout <<
"没有找到符合要求的元素"
<< endl;
}