可变序列算法:就是能改变容器内容的算法。
copy(first1,last1,first2)
复制容器元素
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
void main()
{
vector<int>a;
vector<int>b(5);
a.push_back (4);
a.push_back (7);
a.push_back (2);
a.push_back (5);
a.push_back (8);
copy(a.begin (),a.end (),b.begin () ); //copy data
for(int i=0;i<a.size();i++)
{
cout<<a[i]<<" ";
}
cout<<endl;
for(int j=0;j<b.size();j++)
{
cout<<b[j]<<" ";
}
cout<<endl;
system("pause");
}
fill(first,last,data)
把irst和list的范围内的值都变成值data
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
void main()
{
vector<int>a;
a.push_back (4);
a.push_back (7);
a.push_back (2);
a.push_back (5);