//algorithm  find演示

#include <vector>

#include <algorithm>

#include <iostream>

using namespace std;

 int main()  {

    //find算法示例

    int array[] = {,,,};

    vector<int> v; v.push_back();

    v.push_back(); v.push_back();

    v.push_back(); vector<int>::iterator p;

    p = find(v.begin(),v.end(),);

    if( p != v.end())

        cout << * p << endl; //输出3

    p = find(v.begin(),v.end(),);

    if( p == v.end()) cout << "not found " << endl;

        p = find(v.begin()+,v.end()-,); //整个容器：[1,2,3,4]， 查找区间：[2,3) if( p != v.end())

    cout << * p << endl;

    int * pp = find( array,array+,);//数组名是迭代器 cout << * pp << endl;

}