STL算法迭代器简单实用

最新推荐文章于 2024-08-13 16:29:35 发布

MeetingParis

最新推荐文章于 2024-08-13 16:29:35 发布

阅读量124

点赞数

本文链接：https://blog.csdn.net/meetingparis/article/details/79825174

版权

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

void main01()
{
	vector<int> v1;//1容器 把你的元素拷贝进容器
	v1.push_back(2);
	v1.push_back(3);
	v1.push_back(4);

	//2迭代器 迭代器相当于指针
	for (vector<int>::iterator it = v1.begin(); it != v1.end(); it++)
	{
		cout << *it << " ";
	}

	//算法和迭代器能无缝连接
	int num1 = count(v1.begin(), v1.end(), 3);
	cout << num1 << endl;
}


//容器装元素
class Teacher
{
public:
	int age;
	char name[60];
};

void main02()
{
	Teacher t1, t2, t3;
	t1.age = 31;
	t2.age = 32;
	t3.age = 33;
	vector<Teacher>v1;
	v1.push_back(t1);
	v1.push_back(t2);
	v1.push_back(t3);

	for (vector<Teacher>::iterator it = v1.begin(); it != v1.end(); it++)
	{
		cout << it->age << " ";
	}
}

//容器装指针
void main03()
{
	Teacher t1, t2, t3;
	t1.age = 31;
	t2.age = 32;
	t3.age = 33;
	Teacher *p1, *p2, *p3;
	p1 = &t1;
	p2 = &t2;
	p3 = &t3;

	vector<Teacher*>v1;
	v1.push_back(p1);
	v1.push_back(p2);
	v1.push_back(p3);

	for (vector<Teacher*>::iterator it = v1.begin(); it != v1.end(); it++)
	{
		cout << (*it)->age << " " << endl;
	}
}

void main()
{
	main03();
}