stl容器算法迭代器三大概念入门

来源：互联网发布：mac os x 重装超慢编辑：程序博客网时间：2024/06/13 20:35

传智扫地僧课程学习笔记。

之前，数据结构都是得自己写，

现在可以直接用，好省事，

#include "iostream"using namespace std;#include "vector"#include "algorithm"void mian11(){vector<int> v1;//把你的元素拷贝到容器中v1.push_back( 1 );//v1.push_back( 2 );v1.push_back( 3 );v1.push_back( 3 );//2，迭代器，相当于一个指针分类，for( vector<int>::iterator it = v1.begin(); it!=v1.end(); it++){cout<<*it<<" ";}cout<<endl;//算法，int num1 = count(v1.begin(), v1.end(),3);cout<<"num: "<<num1<<endl;}class teacher{public:int age;char name[64];public:void printT(){cout<<"age:"<<age<<endl;}};void main12(){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++){it->printT();}cout<<endl;}void main13(){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(){//mian11();//main12();main13();system("pause");}//算法，容器，迭代器，好爽，都是现成的直接用~

0 0