全组合

package cn.xmu.microsoft;

public class T32_1 {

	private char[] c = {'A','B','C'};
	private int[] total = {3,3,3,3};
	static int count = 0;
	private void RecursiveSearch(int[] answer,int index,int n){
		if(index == n){
			for(int i = 0;i < n;i++){
				System.out.print(c[answer[i]]);
			}
			System.out.println();
			count++;
			return;
		}
		for(answer[index] = 0;answer[index] < total[index];answer[index]++){
			RecursiveSearch( answer, index+1, n);
		}
	}
	
	public static void main(String[] args){
		
		int[] a = new int[4];
		for(int i = 0;i<4;i++){
			a[i] = 0;
		}
		T32_1 t32 = new T32_1();
		t32.RecursiveSearch(a, 0, 4);
		System.out.println(count);
	}
}

 total用来控制排列的每一位上，选取前几个字符。

 比如候选字符有a,b,c,d  长度为3的字符串，每位可重复，共有4*4*4

 如果每位不允许重复，则有4*3*2，可参考：http://genie13.iteye.com/blog/1664860