需求描述:有2组数,分别是A组1,2,3,4,5,6,7,8,9。B组1,2,3,4,5,6,7,8,9。用A1和B2,3,4,5,6,7,8,9组合,用A2和B1,3,4,5,6,7,8,9组合。用A1A2和B3,4,5,6,7,8,9组合。用A1A2A3......和B....组合。意思是我在A组随便选什么数或者是选择几个数(但选择顺序是从1到9的),然后和B组中除开A组中选择的数的其他数组成1-9。数学公式就是计算 C9-1.....到C9-8之和就能得出有多少种组合,现在需要用代码把每种组合都遍历出来。
String [] s={"s0","s1","s2","s3","s4","s5","s6","s7","s8"};
String [] s1={"0","1","2","3","4","5","6","7","8"};
for (int i = 0; i < s.length; i++) {
System.out.print(s[i]);
for (int j1 = i; j1 > 0; j1--) {
System.out.print(s1[j1-1]);
}
for (int j = i+1; j < s1.length; j++) {
System.out.print(s1[j]);
}
System.out.println("");
}现在 只算了 s 数组 就只拿了一个 来算...我要拿2个 咋拿- -