前言:
这个的话主要是解决排列组合的问题,也就是全排列的问题,比如1 2 3 进行全排列,如果我们自己写的话,肯定是dfs来写,但是我们可以用现成的算法next_permutation
next_permutation
next_permutation()会取得[first,last)所标示之序列的下一个排列组合,如果没有下一个排列组合,便返回false;否则返回true。所以我们必须保证容器里的元素顺序是最小的,这能才能产生全排列的正取结果。
//default (1)
template <class BidirectionalIterator>
bool next_permutation (BidirectionalIterator first,
BidirectionalIterator last);
//custom (2)
template <class BidirectionalIterator, class Compare>
bool next_permutation (BidirectionalIterator first,
BidirectionalIterator last, Compare comp);
举个例子:
// next_permutation example
#include <iostream> // std::cout
#include <algorithm> // std::next_permutation, std::sort
int main () {
int myints[] = {1,2,3};
std::sort (myints,myints+3);
std::cout << "The 3! possible permutations with 3 elements:\n";
do {
std::cout << myints[0] << ' ' << myints[1] << ' ' << myints[2] << '\n';
} while ( std::next_permutation(myints,myints+3) );
std::cout << "After loop: " << myints[0] << ' ' << myints[1] << ' ' << myints[2] << '\n';
return 0;
}
非STL版本
//用dfs来写全排列,但是这个的话只能是最多11个数的全排列(时间为一秒)
# include <bits/stdc++.h>
using namespace std;
int book[12],a[12];
int ans[12];
void dfs(int step,int &num){
if(step == num+1){
for(int i=1;i<=num;++i) cout<<ans[i]<<' ';
cout<<endl; return;
}
for(int i=1;i<=num;++i){
if(book[i]==0){
book[i] = 1;
ans[step] = a[i];
dfs(step+1,num);
book[i] = 0;
}
}
return ;
}
void test(){
int n;
cin>>n;
for(int i=1;i<=n;++i){
cin>>a[i];
}
sort(a,a+n);
dfs(1,n);
}
int main () {
test();
return 0;
}
prev_permutation
在STL中,除了next_permutation外,还有一个函数prev_permutation,两者都是用来计算排列组合的函数。前者是求出下一个排列组合,而后者是求出上一个排列组合。所以这也就意味着当前的容器元素顺序必须是最大的,这样才能保证反向的全排列的正确结果。
//default (1)
template <class BidirectionalIterator>
bool prev_permutation (BidirectionalIterator first,
BidirectionalIterator last );
//custom (2)
template <class BidirectionalIterator, class Compare>
bool prev_permutation (BidirectionalIterator first,
BidirectionalIterator last, Compare comp);
举个例子:
// next_permutation example
#include <iostream> // std::cout
#include <algorithm> // std::next_permutation, std::sort, std::reverse
int main () {
int myints[] = {1,2,3};
std::sort (myints,myints+3);
std::reverse (myints,myints+3);
std::cout << "The 3! possible permutations with 3 elements:\n";
do {
std::cout << myints[0] << ' ' << myints[1] << ' ' << myints[2] << '\n';
} while ( std::prev_permutation(myints,myints+3) );
std::cout << "After loop: " << myints[0] << ' ' << myints[1] << ' ' << myints[2] << '\n';
return 0;
}