#include<iostream>
#include<vector>
using namespace std;
int main(){
int a[]={1,2,3,4,5,6,7,8,9,10};
vector<int>v(a,a+10);
fill(v.begin(),v.end(),20);
for(vector<int>::iterator iter=v.begin();iter!=v.end();++iter){
cout<<*iter<<endl;
}
system("pause");
return 0;
}
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(){
vector<int>v;
v.resize(10);
fill_n(v.begin(),10,0);
for(vector<int>::iterator iter=v.begin();iter!=v.end();++iter){
cout<<*iter<<endl;
}
system("pause");
return 0;
}
#include<iostream>
#include<vector>
using namespace std;
int main(){
vector<int>v;
fill_n(back_inserter(v),10,10086);
for(vector<int>::iterator iter=v.begin();iter!=v.end();++iter){
cout<<*iter<<endl;
}
cout<<endl;
system("pause");
return 0;
}
找到规律了吗,fill()前提是容器已经有了可用的范围,有了大小,而fill_n()可以使用resize()确定容量的大小,也可以用back_inserter()