如果给定N个不同字符,将这N个字符全排列,最终的结果将会是N!种。
如:给定 A、B、C、D四个不同的字符,则结果为:
ABDC
ACBD
ACDB
ADBC
ADCB
BACD
BADC
BCAD
BCDA
BDAC
BDCA
CABD
CADB
CBAD
CBDA
CDAB
CDBA
DABC
DACB
DBAC
DBCA
DCAB
DCBA一共4!=24种情况。
-----------------------------------------------------------------------code------------------------------------------------------------------------------------------------
package Al2014;
import java.util.Scanner;
import java.util.Vector;
//用的是递归的方法
public class AL1_1 {
/**
* @param args
*/
public static int count=0;
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String str=sc.nextLine();
Vector<Character> source=new Vector<Character>();
Vector<Character> result=new Vector<Character>();
for(int i=0;i<Integer.parseInt(str);i++)
{
source.add((char)('A'+i));
}
convert(source, result);
System.out.println(count);
/* String n="";
int k=0;
try{
System.out.println("请输入一个数字:");
Scanner sc=new Scanner(System.in);
n=sc.nextLine();
k=Integer.parseInt(n);
while(k!=0){
for(int i=0;i<k;i++)
{
System.out.print((char)('A'+i));
}
System.out.println();
System.out.println("请输入一个数字:");
Scanner sc1=new Scanner(System.in);
k=Integer.parseInt(sc1.nextLine());
}
}catch(Exception e)
{
System.out.print("error");
}
*/
}
public static void convert(Vector<Character> source,
Vector<Character> result) {
if(source.size()==0)
{
for(int i=0;i<result.size();i++)
{
System.out.print(result.elementAt(i));
}
System.out.print("\n");
count++;
//return;
}
for(int i=0;i<source.size();i++)
{
Vector<Character> consour=new Vector<Character>(source);
Vector<Character> conresu=new Vector<Character>(result);
conresu.add(consour.elementAt(i));
consour.remove(i);
convert(consour,conresu);
}
}
}