如果给定N个不同字符,将这N个字符全排列,最终的结果将会是多少种?
答案:N!
import java.util.Vector;
import java.util.Scanner;
public class Main{
static int count=0;
private static void fullPremutation(Vector<Character> source,Vector<Character> result){
//当source中的元素为空,result中获得全部元素,在当前排列顺序下打印即可
if(source.size()==0){
for(int i=0;i<result.size();i++){
System.out.print(result.elementAt(i));
}
System.out.println();
count++;
}
for(int i=0;i<source.size();i++){
Vector<Character> tsource = new Vector<Character>(source);
Vector<Character> tresult = new Vector<Character>(result);
tresult.add(source.elementAt(i));
tsource.remove(i);
//使用递归方法,遍历每一种排序方法
fullPremutation(tsource,tresult);
}
}
public static void main(String[] args){
Scanner s=new Scanner(System.in);
int n=s.nextInt();
Vector<Character> tsource = new Vector<Character>();
Vector<Character> tresult = new Vector<Character>();
//给tsource向量数组赋值
for(int i=0;i<n;i++){
tsource.add((char)('A'+i));
}
fullPremutation(tsource,tresult);
System.out.print(count);
}
}