STL初识

vector存放内置数据类型

vector相当于一个数组

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>


void myprint(int val) {
	cout << val << endl;
}

void test01() {
	vector<int>v;
	v.push_back(10);
	v.push_back(20);
	v.push_back(30);
	v.push_back(40);
	v.push_back(50);

	vector<int>::iterator itBegin = v.begin();  //起始迭代器，指向容器第一个元素
	vector<int>::iterator itEnd = v.end();      //结束迭代器，指向容器中最后一个元素的下一个位置

	//第一种迭代方式
	while (itBegin != itEnd)
	{
		cout << *itBegin << endl;
		itBegin++;
	}
	//第二种迭代方式
	for (vector<int>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << *it << endl;
	}
	//第三种迭代方式，利用STL提供的便历算法
	for_each(v.begin(), v.end(), myprint);

}

int main() {
	test01();

}

vector存放自定义数据类型

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>

class Person {
public:
	Person(string name, int age)
	{
		this->m_Name = name;
		this->m_Age = age;
	}
public:
	string m_Name;
	int m_Age;
};

void test01() {
	vector<Person>v;
	Person p1("aaa", 10);
	Person p2("bbb", 20);
	Person p3("ccc", 30);
	Person p4("ddd", 40);
	Person p5("eee", 50);
	v.push_back(p1);
	v.push_back(p2);
	v.push_back(p3);
	v.push_back(p4);
	v.push_back(p5);


	//第二种迭代方式
	for (vector<Person>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << (*it).m_Name<<"\t" << (*it).m_Age << endl;
	}

}

int main() {
	test01();

}

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>

class Person {
public:
	Person(string name, int age)
	{
		this->m_Name = name;
		this->m_Age = age;
	}
public:
	string m_Name;
	int m_Age;
};

void test01() {
	vector<Person*>v;
	Person p1("aaa", 10);
	Person p2("bbb", 20);
	Person p3("ccc", 30);
	Person p4("ddd", 40);
	Person p5("eee", 50);
	v.push_back(&p1);
	v.push_back(&p2);
	v.push_back(&p3);
	v.push_back(&p4);
	v.push_back(&p5);


	//第二种迭代方式
	for (vector<Person*>::iterator it = v.begin(); it != v.end(); it++)
	{
		cout << (*it)->m_Name<<"\t" << (*it)->m_Age << endl;
	}

}

int main() {
	test01();

}
----------------------------------------------------------结果---------------------------------------------------------
aaa     10
bbb     20
ccc     30
ddd     40
eee     50

容器嵌套容器

vector相当于一个数组，容器嵌套容器相当于一个二维数组

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
#include<string>


void test01() 
{
	vector<vector<int>>v;
	vector<int>v1;
	vector<int>v2;
	vector<int>v3;
	vector<int>v4;
	vector<int>v5;
	for (int i = 0; i < 5; i++)
	{
		v1.push_back(i + 1);
		v2.push_back(i + 2);
		v3.push_back(i + 3);
		v4.push_back(i + 4);
		v5.push_back(i + 5);
	}
    //将容器元素插入到vector v中
	v.push_back(v1);
	v.push_back(v2);
	v.push_back(v3);
	v.push_back(v4);
	v.push_back(v5);

	//通过大容器，把所有数据便历一遍
	for (vector<vector<int>>::iterator it = v.begin(); it != v.end(); it++)
	{
		//(*it)就是容器 <vector<int>>
		for (vector<int>::iterator vit = (*it).begin(); vit != (*it).end(); vit++)
		{
			cout << *vit << " ";
		}
		cout << endl;

	}

}

int main() {
	test01();

}