递归排列

一、生成1~n的组合排列

void permutation(int n,int A[],int cur) { if(cur == n) //递归边界,若在A中填满N个数,则构成一个完整排列,将其输出 { for(int i = 0;i < n;++i) cout << A[i]; cout << endl; } else for(int i = 1;i <= n;++i) //在A[cur]中填各种整数i { int ok = 1; for(int j = 0;j < cur;++j) if(A[j] == i) ok = 0; //如果i已经在A[0]到A[cur-1]出现过，则做标记,不能再次选择 if(ok) { A[cur] = i; permutation(n,A,cur+1);//递归调用 } } }

 

二、生成可重集的全排列

//n表示A是要输出的数组,P是已知数组,从数组从提取各个数字进行可重集全排列 void permutation(int n,int A[],int P[],int cur) { if(cur == n) //递归边界,若在A中填满N个数,则构成一个完整排列,将其输出 { for(int i = 0;i < n;++i) cout << A[i]; cout << endl; } else for(int i = 0;i < n;++i) { if(!i || P[i] != P[i-1]) //这一判断是防止类似于1,1,1这种数列输出多次,检查P的第一个元素和所有与"前一个元素不相同"的元素 { int c1 = 0,c2 = 0;//c1统计A[0]到A[cur-1]中P[i]出现的次数,c2统计P[i]出现次数 for(int j = 0;j < cur;++j) if(A[j] == P[i]) c1++; for(int j = 0;j < n;++j) if(P[i] == P[j]) c2++; if(c1 < c2)//若c1 < c2 则满足递归调用条件 { A[cur] = P[i]; permutation(n,A,P,cur+1); } } } }

三、利用STL中的next_permutation这一函数生成下一排列

先简单介绍下这一标准库函数，记住使用前必须先排序，他的作用就是生成当前排列下一个排列情况，因此通过循环便可完成全排列工作，而且还可以完成包括字母的排列，包括可重集。

template <class BidirectionalIterator>
  bool next_permutation (BidirectionalIterator first,
                         BidirectionalIterator last );

template <class BidirectionalIterator, class Compare>
  bool next_permutation (BidirectionalIterator first,
                         BidirectionalIterator last, Compare comp);

Transform range to next permutation

Rearranges the elements in the range [first, last) into the lexicographically next greater permutation of elements. The comparisons of individual elements are performed using either operator< for the first version, or comp for the second.

A permutation is each one of the N! possible arrangements the elements can take (where N is the number of elements in the range). Different permutations can be ordered according on how they compare lexicographicaly to each other; The first such-sorted possible permutation (the one that would compare lexicographically smaller to all other permutations) is the one which has all its elements sorted in ascending order, and the largest has all its elements sorted in descending order.

If the function can determine the next higher permutation, it rearranges the elements as such and returns true. If that was not possible (because it is already at the largest), it rearranges the elements according to the first permutation (sorted in ascending order) and returns false.

Parameters

first, last

Bidirectional iterators to the initial and final positions of the sequence. The range used is [first,last), which contains all the elements between first and last, including the element pointed by first but not the element pointed by last.

comp

Comparison function object that, taking two values of the same type than those contained in the range, returns true if the first argument is to be considered less than the second argument.

Return value

true if the function could rearrange the object as a lexicographicaly greater permutation. Otherwise, the function returns false to indicate that the arrangement is not greater than the previous, but the lowest possible (sorted in ascending order).

实例如下：

//对一字符串进行全排列，只需要这么点程序就可以轻松解决 //如输入abc则输出abc,acb,bac,bca,cab,cba #include<iostream> #include<algorithm> using namespace std; int main() { char p[10]; cin >> p; int n = strlen(p); sort(p,p + n); do { cout << p << endl; }while(next_permutation(p,p + n)); return 0; }