// 先声明两个全局变量
private static int length;
private static int count;
// 调用此方法,参数为可变长数组
private static void execute(String[]... args) {
length = args.length;
PrintcartesianProduct(args, "", 0);
System.out.println("共有" + count + "种组合方式");
}
// 递归调用打印笛卡尔积
private static void PrintcartesianProduct(String[][] args, String result, int index) {
if (index < length) {
if(args[index].length == 0){
PrintcartesianProduct(args, result + " ", index + 1);
}
for (String s : args[index]) {
PrintcartesianProduct(args, result + " " + s + " ", index + 1);
}
} else if(length != 0){
System.out.println(result);
count++;
}
}
// main方法调用,支持以下多种调用方式。
public static void main(String[] args) {
execute();
execute(new String[]{"A","B"});
execute(new String[]{"A","B"},new String[]{"C","D"});
execute(new String[]{"A","B"},new String[]{},new String[]{"C","D"});
}
运行结果如:
A C
A D
B C
B D
共有4种组合方式