C++ STL标准库：算法＜algorithm＞ 查找最后位置 find_end()

std::find_end

简介：

在序列 A 中查找序列 B 最后一次出现的位置。

函数原型

equality (1)	template <class ForwardIterator1, class ForwardIterator2>
   				ForwardIterator1 find_end (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2);
predicate (2)	template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
   				ForwardIterator1 find_end (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);

官方手册
http://www.cplusplus.com/reference/algorithm/find_end/

使用示例：

#include <functional>
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

template <class T>
void FillValue(T& vect, int first, int last)
{
	if (last >= first)
	{
		for (int i = first; i <= last; ++i)
			vect.insert(vect.end(), i);
	}
	else
	{
		cout << " The indexes is error: last < first. " << endl;
	}
}

void print(int elem)
{
	cout << elem << " ";
}

void main()
{
	vector <int> myvector;
	vector <int> subvector;
	FillValue(myvector, -3, 12);
	FillValue(myvector, -3, 6);
	FillValue(subvector, -1, 3);
	for_each(myvector.begin(), myvector.end(), print);
	cout << endl;
	for_each(subvector.begin(), subvector.end(), print);
	cout << endl;

	vector<int>::iterator pos1;
	//   pos1=find_first_of(myvector.begin(),myvector.end(),subvector.begin(),subvector.end());
	pos1 = find_end(myvector.begin(), myvector.end(), subvector.begin(), subvector.end());

	if (pos1 != myvector.end())
	{
		// 	   cout<<"第一个子串在原串中的位置: "<<distance(myvector.begin(),pos1)+1<<endl;
		cout << "最后一个子区间在原串中的位置: " << distance(myvector.begin(), pos1) + 1 << endl;
	}
	else
	{
		cout << "没有搜索到需要的子串." << endl;
	}

	vector<int>::reverse_iterator rpos;
	rpos=find_first_of(myvector.rbegin(),myvector.rend(),subvector.begin(),subvector.end());
	cout<<"原串中最后一个字串的位置: "<<distance(myvector.begin(),rpos.base())<<endl;
}