查找-4

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

using namespace std;
int main()
{
	vector<int> ivec;
	list<int> searchlist;
	for (int i = 1; i <= 11; ++i)
		ivec.push_back(i);
	searchlist.push_back(5);
	searchlist.push_back(6);
	searchlist.push_back(7);
	for (auto iter = ivec.begin(); iter != ivec.end(); ++iter)
		cout << *iter << " ";
	cout << endl;
	for (auto iter = searchlist.begin(); iter != searchlist.end(); ++iter)
		cout << *iter << " ";
	cout << endl;

	auto pos=find_first_of(ivec.begin(), ivec.end(), searchlist.begin(), searchlist.end());//挨个找，找不到3找6，找不到6，找9
	if (pos != ivec.end())//找到第一个就停下来了
		cout << "find ok::" << distance(ivec.begin(), pos) + 1 << endl;
	else
		cout << "find error" << endl;
	//找最后一个，string有findfirst和lastof
	auto rpos = find_first_of(ivec.rbegin(), ivec.rend(), searchlist.begin(), searchlist.end());
	cout << "find ok:" << distance(ivec.begin(), rpos.base()) << endl;

	string numerics("0123456789");
	string name("ra8d3j");
	//string既有find first和last。
	auto pos7 = name.find_first_of(numerics); 
	if (pos7 != string::npos)
		cout << "find ok first:" <<pos7<< endl;

	auto pos8 = name.find_last_of(numerics);
	if (pos7 != string::npos)
		cout << "find ok last:" << pos8<<endl;

	system("pause");
	return 0;


}