STL_初识基本操作_vector_笔记

#include
using namespace std;
#include
#include//标准算法头文件
void myPrint(int val)
{
  cout }
int main()
{
  //创建一个vector容器，数组
  vector v;
  //向容器中插入数据
  v.push_back(10);
  v.push_back(20);
  v.push_back(30);
  v.push_back(40);
  //通过迭代器访问容器中的数据
  //起始迭代器，指向容器中第一个元素
  vector::iterator itBegin = v.begin();
  //结束迭代器，指向容器中最后一个元素的下一个位置
  vector::iterator itEnd = v.end();
  //第一种遍历方式
  while (itBegin != itEnd)
  {
    cout     itBegin++;
  }
  //第二种遍历
  for (vector::iterator it = v.begin(); it != v.end(); it++)
  {
    cout   }
  //第三种遍历，利用STL提供的遍历算法
  for_each(v.begin(), v.end(), myPrint);
  return 0;
}

#include
using namespace std;
#include
#include
#include
class Person
{
public:
  string m_name;
  int m_age;
  Person(string name, int age)
  {
    this->m_name = name;
    this->m_age = age;
  }
};
int main()
{
  vectorv;
  Person p1("A", 1);
  Person p2("B", 2);
  Person p3("C", 3);
  v.push_back(p1);
  v.push_back(p2);
  v.push_back(p3);
  for (vector::iterator it = v.begin(); it != v.end(); it++)
  {
    cout   }
  return 0;
}

vectorv;
  Person p1("A", 1);
  Person p2("B", 2);
  Person p3("C", 3);
  v.push_back(&p1);
  v.push_back(&p2);
  v.push_back(&p3);
  for (vector::iterator it = v.begin(); it != v.end(); it++)
  {
    cout   }

#include
using namespace std;
#include
#include
#include
class Person
{
public:
  string m_name;
  int m_age;
  Person(string name, int age)
  {
    this->m_name = name;
    this->m_age = age;
  }
};
int main()
{
  vector> v;
  vector v1;
  vector v2;
  vector v3;
  vector v4;
  //向小容器中添加数据
  for (int i = 0; i   {
    v1.push_back(i);
    v2.push_back(i + 1);
    v3.push_back(i + 2);
    v4.push_back(i + 3);
  }
  //将小容器添加到大容器中
  v.push_back(v1);
  v.push_back(v2);
  v.push_back(v3);
  v.push_back(v4);
  //通过大容器，把所有数据遍历一遍
  for (vector>::iterator it = v.begin(); it != v.end(); it++)
  {
    for (vector::iterator vit = (*it).begin(); vit != (*it).end(); vit++)
    {
      cout     }
    cout   }
  return 0;
}