poj1256 c++中next_permutation函数初尝试

题目链接

Description
You are to write a program that has to generate all possible words from a given set of letters.
Example: Given the word “abc”, your program should - by exploring all different combination of the three letters - output the words “abc”, “acb”, “bac”, “bca”, “cab” and “cba”.
In the word taken from the input file, some letters may appear more than once. For a given word, your program should not produce the same word more than once, and the words should be output in alphabetically ascending order.
Input
The input consists of several words. The first line contains a number giving the number of words to follow. Each following line contains one word. A word consists of uppercase or lowercase letters from A to Z. Uppercase and lowercase letters are to be considered different. The length of each word is less than 13.
Output
For each word in the input, the output should contain all different words that can be generated with the letters of the given word. The words generated from the same input word should be output in alphabetically ascending order. An upper case letter goes before the corresponding lower case letter.
Sample Input
3
aAb
abc
acba
Sample Output
Aab
Aba
aAb
abA
bAa
baA
abc
acb
bac
bca
cab
cba
aabc
aacb
abac
abca
acab
acba
baac
baca
bcaa
caab
caba
cbaa
Hint
An upper case letter goes before the corresponding lower case letter.
So the right order of letters is ‘A’<‘a’<‘B’<‘b’<…<‘Z’<‘z’.

大致意思就是输出给定字符串的全排列，大小关系为‘A’<‘a’<‘B’<‘b’<…<‘Z’<‘z’

next_permutation函数：

组合数学中经常用到排列，这里介绍一个计算序列全排列的函数：next_permutation（start,end），和prev_permutation（start,end）。这两个函数作用是一样的，区别就在于前者求的是当前排列的下一个排列，后一个求的是当前排列的上一个排列。至于这里的“前一个”和“后一个”，我们可以把它理解为序列的字典序的前后，严格来讲，就是对于当前序列pn，他的下一个序列pn+1满足：不存在另外的序列pm，使pn<pm<pn+1.
即使有重复的元素也会生成所有的排列

对于next_permutation函数，其函数原型为：

 #include <algorithm>

 bool next_permutation(iterator start,iterator end)

当前序列不存在下一个排列时，函数返回false，否则返回true

需要强调的是，next_permutation（）在使用前需要对想要排列的数组按升序排序，否则只能找出该序列之后的全排列数。
此外，next_permutation（node,node+n,cmp）可以对结构体node按照自定义的排序方式cmp进行排序

		//常用形式：即先排序，再使用该函数
		sort(letter, letter + strlen(letter), cmp);
		do {
			cout << letter << endl;
		} while (next_permutation(letter, letter + strlen(letter), cmp));

代码：

#include <iostream>
#include <algorithm>
#include<string>
#include<cstring>
#include<string.h>
using namespace std;

bool cmp(char a, char b) {//按照要求比较大小
	if (tolower(a) != tolower(b)) { return tolower(a) < tolower(b); }
	else return a < b;//注意本身小写字母的排列就大于大写字母  'a' - 'A' equals 32;
}
char letter[14];
int main(){
	int t;
	cin >> t;
	while (t--) {
		cin >> letter;
		sort(letter, letter + strlen(letter), cmp);
		do {
			cout << letter << endl;
		} while (next_permutation(letter, letter + strlen(letter), cmp));
	}
	system("pause");
}