STL find查找STL容器

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

using namespace std;


int main () 
{
	//STL find array
	int nArr[5] = {10,20,30,40,50};
	int *p = nullptr;

	p = find(nArr,nArr+4,30); //找到30
	//++p; //40
	cout << *p << endl;
		
	//STL find vector
	vector<int> vecN(nArr,nArr+4);	//拷贝
	vector<int>::iterator itVec;
	itVec = find(vecN.begin(),vecN.end(),20); //找到20
	cout << *itVec << endl;

	char* SArr[3] = {"ab","cd","ef"};
	vector<char*> vecS(SArr,SArr+2);
	vector<char*>::iterator itVecS;
	itVecS = find(vecS.begin(),vecS.end(),"cd"); //找到20
	cout << *itVecS << endl;

	//string error
	/*vector<string> vecS1(SArr,SArr+2);
	vector<string>::iterator itVecS1;
	string findS = "ef";
	itVecS1 = find(vecS1.begin(),vecS1.end(),findS); //找到20
	cout << itVecS1->c_str() << endl;*/

	//STL find list
	list<int> listN(nArr,nArr+4);
	list<int>::iterator itL;
	itL = find(listN.begin(),listN.end(),10);
	cout << *itL << endl;

	//STL find map
	map<int,int> manN;
	manN[1] = 1;
	manN[2] = 2;
	map<int,int>::iterator itMap;
	itMap = manN.find(2);
	cout << itMap->first << endl;


	return(0);
}