STL vector 的使用算法

来源：互联网发布：显卡驱动升级软件编辑：程序博客网时间：2024/04/27 22:19
#include<iostream>using namespace std;#include<vector>//向量#include<iterator>//迭代器#include<algorithm>//算法#include<functional>//函数//STL三大组件：容器，算法，迭代器/*void main(){int ar[]={1,2,3,4,5,6,3,2};vector<int> a(ar,ar+8);a.push_back(1);a.push_back(2);//copy(istream_iterator<int>(cin),istream_iterator<int>(),back_insert_iterator<vector<int>>(a));//从键盘输入copy(a.begin(),a.end(),ostream_iterator<int>(cout," "));//拷贝：输出cout<<endl;sort(a.begin(),a.end());//在STL算法中，可以直接调用sort函数copy(a.begin(),a.end(),ostream_iterator<int>(cout," "));cout<<endl;}*//*void print(int n);bool greater5(int n);template<class Type>class Print{public:void operator()(Type n){cout<<n<<" ";}};template<class Type>class Greater{public:Greater(int d):value(d){}bool operator()(Type m){return value>m;}private:Type value;};void main(){int a[]={2,5,7,1,8};int b[5];int n=sizeof(a)/sizeof(a[0]);sort(a,a+n,greater<int>());//greater()是从大到小排序copy(a,a+n,ostream_iterator<int>(cout," "));cout<<endl;sort(a,a+n,less<int>());//less()是从小到大排序copy(a,a+n,ostream_iterator<int>(cout," "));cout<<endl;copy(a,a+n,b);copy(b,b+n,ostream_iterator<int>(cout," "));//把a拷贝到b中cout<<endl;for_each(b,b+n,print);//最后一个传的是函数名for_each相当于for循环cout<<endl;for_each(b,b+n,Print<int>());//如果输出要求带类型的话，就把后面的写成一个类cout<<endl;vector<int>vt(a,a+n);//重新定义一个向量的容器把a数组放进去for(int i=0;i<n;i++){cout<<vt.at(i)<<" ";//用.at()可以访问向量中的数据元素}cout<<endl;vector<int>::iterator iter;//用迭代器也可以访问向量中的数据元素for(iter=vt.begin();iter!=vt.end();iter++){cout<<*iter<<" ";}cout<<endl;iter=find(vt.begin(),vt.end(),100);if(iter!=vt.end()){cout<<*iter<<" ";//找到就输出，找不到就不输出}iter=vt.begin();while(iter!=vt.end()){iter=find_if(iter,vt.end(),greater5);//find_if是查找一个范围if(iter==vt.end())break;cout<<*iter<<" ";iter++;}cout<<endl;iter=vt.begin();while(iter!=vt.end()){iter=find_if(iter,vt.end(),Greater<int>(2));if(iter==vt.end())break;cout<<*iter<<" ";iter++;}}void print(int n){cout<<n<<" ";}bool greater5(int n){return n>5;}*//*template<class Type>class Greater{public:Greater(int d):value(d){}bool operator()(Type m){return value>m;}private:Type value;};int main(){vector<int> a;for(int i=1;i<10;i++){a.push_back(i);}a.push_back(2);a.push_back(3);a.push_back(5);a.push_back(3);int n=count(a.begin(),a.end(),2);//计算向量a当中有多少个2cout<<n<<endl;n=count_if(a.begin(),a.end(),Greater<int>(2));cout<<n<<endl;copy(a.begin(),a.end(),ostream_iterator<int>(cout," "));cout<<endl;replace(a.begin(),a.end(),2,10);//把2换成10copy(a.begin(),a.end(),ostream_iterator<int>(cout," "));cout<<endl;transform(a.begin(),a.end(),ostream_iterator<int>(cout," "),negate<int>());//取反}*/void main(){int a[5]={2,5,6,7,4};int b[5]={3,5,7,8,9};reverse(a,a+5);for(int i=0;i<5;i++){cout<<a[i]<<" ";}cout<<endl;swap_ranges(a,a+5,b);//交换a与bfor(int i=0;i<5;i++){cout<<a[i]<<" ";}}
0 0