万能搜索

public class Main {

private static int a[] = new int[10];
private static int flag[] = new int [10];
private static int total = 0;

public static void main(String[] args) {
//首先站在第一个盒子面前
dfs(1);

}

private static void dfs(int step) {

int i;
if (step == 10) {
if (a[1]*100+a[2]*10+a[3] +a[4]*100+a[5]*10+a[6] == a[7]*100+a[8]*10+a[9]) {
total++;
System.out.println(a[1]+","+a[2]+","+a[3]+","+a[4]+","+a[5]+","+a[6]+","+a[7]+","+a[8]+","+a[9]);

}
return;
}

for (i = 1;i<=9;i++) {
if (flag[i] == 0) {
a[step] = i;
flag[i] = 1;
dfs(step+1);
flag[i] = 0;
}
}

}

}