算法.stl.vector

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
struct Person
{
    string name;
    int age;
};

void test01()
{
    struct Person p1 = { "hhh",2 };
    struct Person p2 = { "hh",8 };
    vector<struct Person> v;
    v.push_back(p1);
    v.push_back(p2);
   
    //遍历方法1
    //vector<int>::iterator itBegin = v.begin();//相当于一个指针
    //vector<int>::iterator itEnd = v.end();
    //while (itBegin != itEnd)
    //{
    //    cout << *itBegin << endl;
    //    itBegin++;
    //}


    //遍历方法2
    /*for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
    {
        cout << *it<<endl;
       
    }*/

    for (vector<struct Person>::iterator it = v.begin(); it != v.end(); it++)
    {
        cout << it->age <<" "<< it->name << endl;
    }

}
int main()
{
   
   test01();


}