#include <iostream>
#include <vector>
#include <iterator>
#include <list>
#include <algorithm>
using namespace std;
int main()
{
vector<int> v;
list<int>l;
for(int i = 0; i < 5; i++)
{
v.push_back(i);
}
for(int i = 0; i < 5; i++)
{
l.push_back(i+1);
}
vector<int>::iterator vi = find(v.begin(),v.end(),3);
//replace_copy(l.begin(),l.end(),inserter(v,vi),5,6);//0121234634 12345
//replace_copy(l.begin(),l.end(),back_inserter(v),5,6);//0123412346 12345
vector<int>::iterator tian = v.begin();
while(tian!=v.end())
{
cout<<*tian++;
}
cout<<endl;
list<int>::iterator hong = l.begin();
while(hong!=l.end())
{
cout<<*hong++;
}
return 0;
}
#include <vector>
#include <iterator>
#include <list>
#include <algorithm>
using namespace std;
int main()
{
vector<int> v;
list<int>l;
for(int i = 0; i < 5; i++)
{
v.push_back(i);
}
for(int i = 0; i < 5; i++)
{
l.push_back(i+1);
}
vector<int>::iterator vi = find(v.begin(),v.end(),3);
//replace_copy(l.begin(),l.end(),inserter(v,vi),5,6);//0121234634 12345
//replace_copy(l.begin(),l.end(),back_inserter(v),5,6);//0123412346 12345
vector<int>::iterator tian = v.begin();
while(tian!=v.end())
{
cout<<*tian++;
}
cout<<endl;
list<int>::iterator hong = l.begin();
while(hong!=l.end())
{
cout<<*hong++;
}
return 0;
}