在C++的标准函数库STL中,next_permutation()函数用于求数列的全排列。
函数原型:
template<class BidirectionalIterator>
bool next_permutation(
BidirectionalIterator _First,
BidirectionalIterator _Last
);
template<class BidirectionalIterator, class BinaryPredicate>
bool next_permutation(
BidirectionalIterator _First,
BidirectionalIterator _Last,
BinaryPredicate _Comp
);
两个重载函数,第二个带谓词参数_Comp,其中只带两个参数的版本,默认谓词函数为”小于”。
返回值:bool类型(当前数列是全排列最后一个时,返回false)
例子1(int型):
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int a[] = {3,1,2};
int count = 0;
do{
cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<endl;
count++;
}while (next_permutation(a, a+3));
cout<<"count="<<count<<endl;
system("pause");
return 0;
}
输出:312/321
因为原数列不是从最小字典排列开始。
所以要想得到所有全排列
int a[] = {3,1,2};
然后先排序为:a[] = {1,2,3};
例子2(string型)
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
string str;
cin>>str;
int count = 0;
sort(str.begin(), str.end());
do
{
cout<<str<<endl;
count++;
}while(next_permutation(str.begin(), str.end()));
cout<<"count="<<count<<endl;
system("pause");
return 0;
}
库中另一函数prev_permutation()与next_permutation()相反
因此,上一篇博客的全排列可用非递归方式实现:
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
string str = "14593";
int count = 1;
sort(str.begin(), str.end());
cout << str << endl;
while (next_permutation(str.begin(), str.end()))
{
cout << str << endl;
count++;
}
cout<<"count = "<<count<<endl;
system("pause");
return 0;
}