五、替换
原型:replace(iterator first,iterator last,const T& OldValue,Const T& NewValue);
定义:在区间[first,last]中,用NewValue替换OldValue
原型:replace(iterator first,iterator last, Pred pred,const T& NewValue);
定义:在区间[first,last]中,用NewValue替换使得pred为true的元素
原型:reverse(iterator first,iterator last);
定义:将[first,last]中所有元素按照逆向顺序反转
原型:reverse_copy(iterator1 first,iterator1 last,iterator2 dest);
定义:将[first,last]中所有元素按照逆向顺序反转,然后将全部元素复制到以dest开头的区间内
源代码如下:
原型:rotate(iterator first,iterator middle,iterator last);
定义:将容器看成一个环,将middle处的元素旋转到first的位置为止。
原型:rotate(iterator first,iterator middle,iterator last,iterator2 dest);
定义:将容器看成一个环,将middle处的元素旋转到first的位置,然后将所有元素复制到以dest开头的容器区间中
源代码如下:
八、排列
8.1 按照字典顺序排列元素
原型:next_permutation(iterator first,iterator last);
定义:升序排序,值得注意的是利用next_permutation进行排列时,每次排序只会动一个元素,需要利用while循环完成
最终的排序,循环条件是next_permutation的返回值,排序完成后其返回false
原型:prev_permutation(iterator first,iterator last);
定义:降序排序,值得注意的是利用prev_pemutation进行排列时,每次排序只会动一个元素,利用while循环实现最终的
排序,循环条件是prev_permutation的返回值,排序完成后其返回false
源代码如下:
原型:random_shuffle(iterator first,iterator last);
定义:均匀分布随机排列元素
原型:random shuffle(iterator first,iterator last,Pred pred);
定义:按照指定规则分布,pred为仿函数
源代码:
原型:iterator partition(iterator first,iterator second,Pred pr);
原型:iterator stable_partition(iterator first,iterator second,Pred pr);
定义:按照指定的一元判断式向前搬移元素,当一元判断式为true,向前移动符合条件的元素,函数返回值是使一元判断式为false的第一个元素
源代码如下:
原型:replace(iterator first,iterator last,const T& OldValue,Const T& NewValue);
定义:在区间[first,last]中,用NewValue替换OldValue
原型:replace(iterator first,iterator last, Pred pred,const T& NewValue);
定义:在区间[first,last]中,用NewValue替换使得pred为true的元素
源代码如下:
#include "stdafx.h"
#include "algorithm"
#include "iostream"
#include "iterator"
#include "vector"
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
vector<int> vec;
int dim[]={1,2,3,4,5,6,7,8,9};
vec.assign(dim,dim+9);
copy(vec.begin(),vec.end(),ostream_iterator<int>(cout," "));
cout<<endl;
replace(vec.begin(),vec.end(),7,99);
copy(vec.begin(),vec.end(),ostream_iterator<int>(cout," "));
cout<<endl;
replace_if(vec.begin(),vec.end(),bind2nd(greater<int>(),10),7);
copy(vec.begin(),vec.end(),ostream_iterator<int>(cout," "));
cout<<endl;
return 0;
}
六、逆转
原型:reverse(iterator first,iterator last);
定义:将[first,last]中所有元素按照逆向顺序反转
原型:reverse_copy(iterator1 first,iterator1 last,iterator2 dest);
定义:将[first,last]中所有元素按照逆向顺序反转,然后将全部元素复制到以dest开头的区间内
源代码如下:
#include "stdafx.h"
#include "algorithm"
#include "iostream"
#include "iterator"
#include "vector"
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
vector<int> vec,vec1;
int dim[]={1,2,3,4,5,6,7,8,9};
vec.assign(dim,dim+9);
vec1.resize(9);
copy(vec.begin(),vec.end(),ostream_iterator<int>(cout," "));
cout<<endl;
reverse(vec.begin(),vec.end());
copy(vec.begin(),vec.end(),ostream_iterator<int>(cout," "));
cout<<endl;
reverse_copy(vec.begin(),vec.end(),vec1.begin());
copy(vec1.begin(),vec1.end(),ostream_iterator<int>(cout," "));
cout<<endl;
return 0;
}
七、旋转
原型:rotate(iterator first,iterator middle,iterator last);
定义:将容器看成一个环,将middle处的元素旋转到first的位置为止。
原型:rotate(iterator first,iterator middle,iterator last,iterator2 dest);
定义:将容器看成一个环,将middle处的元素旋转到first的位置,然后将所有元素复制到以dest开头的容器区间中
源代码如下:
#include "stdafx.h"
#include "algorithm"
#include "iostream"
#include "iterator"
#include "vector"
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
vector<int> vec,vec1;
int dim[]={1,2,3,4,5,6,7,8,9};
vec.assign(dim,dim+9);
vec1.resize(9);
copy(vec.begin(),vec.end(),ostream_iterator<int>(cout," "));
cout<<endl;
rotate(vec.begin(),vec.begin()+3,vec.end());
copy(vec.begin(),vec.end(),ostream_iterator<int>(cout," "));
cout<<endl;
rotate_copy(vec.begin(),vec.begin()+6,vec.end(),vec1.begin());
copy(vec1.begin(),vec1.end(),ostream_iterator<int>(cout," "));
cout<<endl;
return 0;
}
八、排列
8.1 按照字典顺序排列元素
原型:next_permutation(iterator first,iterator last);
定义:升序排序,值得注意的是利用next_permutation进行排列时,每次排序只会动一个元素,需要利用while循环完成
最终的排序,循环条件是next_permutation的返回值,排序完成后其返回false
原型:prev_permutation(iterator first,iterator last);
定义:降序排序,值得注意的是利用prev_pemutation进行排列时,每次排序只会动一个元素,利用while循环实现最终的
排序,循环条件是prev_permutation的返回值,排序完成后其返回false
源代码如下:
#include "stdafx.h"
#include "iostream"
#include "algorithm"
#include "deque"
#include "vector"
#include "iterator"
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
deque<int> d1;
vector<int> v1;
int dim[]={1,2,3};
v1.assign(dim,dim+3);
cout<<"vector v1: ";
copy(v1.begin(),v1.end(),ostream_iterator<int>(cout," "));
cout<<endl;
cout<<"queue d1(original):";
copy(v1.begin(),v1.end(),back_inserter(d1));
copy(d1.begin(),d1.end(),ostream_iterator<int>(cout," "));
cout<<endl;
//next_permutation(d1.begin(),d1.end());
while(next_permutation(d1.begin(),d1.end()))
{
copy(d1.begin(),d1.end(),ostream_iterator<int>(cout," "));
cout<<endl;
}
cout<<"排?序?后?;
copy(d1.begin(),d1.end(),ostream_iterator<int>(cout," "));
cout<<endl;
cout<<"准?备?重?新?按2照?降?序?排?序騞1:";
copy(d1.begin(),d1.end(),ostream_iterator<int>(cout," "));
cout<<endl;
while(prev_permutation(d1.begin(),d1.end()))
{
copy(d1.begin(),d1.end(),ostream_iterator<int>(cout," "));
cout<<endl;
}
cout<<"再?次?降?序?排?序?后骴1:o";
copy(d1.begin(),d1.end(),ostream_iterator<int>(cout," "));
cout<<endl;
return 0;
}
8.2 随机排列元素
原型:random_shuffle(iterator first,iterator last);
定义:均匀分布随机排列元素
原型:random shuffle(iterator first,iterator last,Pred pred);
定义:按照指定规则分布,pred为仿函数
源代码:
#include "stdafx.h"
#include "iostream"
#include "algorithm"
#include "deque"
#include "vector"
#include "iterator"
using namespace std;
class myRandom
{
public:
ptrdiff_t operator()(ptrdiff_t max)
{
double tmp;
tmp = static_cast<double>(rand())/static_cast<double>(RAND_MAX);
return static_cast<ptrdiff_t>(tmp * max);
}
};
int _tmain(int argc, _TCHAR* argv[])
{
vector<int> v1;
int dim[]={1,2,3,4,5,6,7,8,9};
v1.assign(dim,dim+9);
cout<<"vector v1:";
copy(v1.begin(),v1.end(),ostream_iterator<int>(cout," "));//输?出?最?初?的?容Y器?中D的?元a素?
cout<<endl;
random_shuffle(v1.begin(),v1.end());
cout<<"vector v1(random)";
copy(v1.begin(),v1.end(),ostream_iterator<int>(cout," "));//输?出?打?乱?顺3序?后?的?vector容Y器?的?元a素?
cout<<endl;
sort(v1.begin(),v1.end());
copy(v1.begin(),v1.end(),ostream_iterator<int>(cout," "));//输?出?排?序?后?的?vector容Y器?的?元a素?
cout<<endl;
myRandom mrd;
random_shuffle(v1.begin(),v1.end(),mrd);
copy(v1.begin(),v1.end(),ostream_iterator<int>(cout," "));//输?出?再?次?打?乱?后?的?容Y器?中D的?元a素?
cout<<endl;
return 0;
}
8.3 向前搬移元素
原型:iterator partition(iterator first,iterator second,Pred pr);
原型:iterator stable_partition(iterator first,iterator second,Pred pr);
定义:按照指定的一元判断式向前搬移元素,当一元判断式为true,向前移动符合条件的元素,函数返回值是使一元判断式为false的第一个元素
源代码如下:
#include "stdafx.h"
#include "iostream"
#include "algorithm"
#include "deque"
#include "vector"
#include "iterator"
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
vector<int> v1,v2;
int dim[]={1,2,3,4,5,6,7,8,9};
v1.assign(dim,dim+9);
v2 = v1;
cout<<"vector v1:";
copy(v1.begin(),v1.end(),ostream_iterator<int>(cout," "));
cout<<endl;
cout<<"vector v2:";
copy(v1.begin(),v1.end(),ostream_iterator<int>(cout," "));
cout<<endl;
vector<int>::iterator pos1,pos2;
pos1 = partition(v1.begin(),v1.end(),not1(bind2nd(modulus<int>(),2)));
pos2 = stable_partition(v2.begin(),v2.end(),not1(bind2nd(modulus<int>(),2)));
cout<<"vector v1(modulus,2,partition):";
copy(v1.begin(),v1.end(),ostream_iterator<int>(cout," "));
cout<<endl;
cout<<"vector v2 (modulus,2,stable_partition):";
copy(v1.begin(),v1.end(),ostream_iterator<int>(cout," "));
cout<<endl;
return 0;
}