传入参数，动态的组织N个数组的所有对数

1. package cn.com.jdlssoft.daup.app.handlers.sjy;
3. public class Jun {
5.     /**
6.      * @param args
7.      */
8.     public static void main(String[] args) {
9.         // TODO Auto-generated method stub
10.         // String a[] = {"1","2","3"};
11.         // String b[] = {"4","5","6"};
12.         // String c[] = {"7","8","9"};
13.         // int count = 0;
14.         // for(int i=0;i<a.length;i++){
15.         // for(int j=0;j<b.length;j++){
16.         // for(int k=0;k<b.length;k++){
17.         // count ++;
18.         // System.out.println(a[i]+":"+b[j]+":"+c[k]);
19.         //                  
20.         // }
21.         // }
22.         // }
23.         // System.out.println(count);
24.         String saveArray[] = {};// 最终保存的数组
25.         String tempArray[] = {};// 临时数组，用于比较
26.         //String yaos = "cp,1;cp,2;";
27.         String yaos = "cp,1;cp,2;cp,2;cp,2;cp,2;cp,2;cp,2;:ycl,3;ycl,4;:dn,5;dn,6;:bb,7;bb,8";
28.         //String yaos = "cp,1;:ycl,3;ycl,4;:dn,5;dn,6;:bb,7;";
29.         String a[] = yaos.split(":");
30.         for (int i = a.length - 1; i <= a.length - 1; i--) {
31.             if (a.length == 1) {
32.                 System.out.println("只有一个，直接退出");
33.                 tempArray = new String[1];
34.                 tempArray[0] = a[i];
35.                 break;
36.             }
38.             if (i == -1) {
39.                 break;
40.             }
42.             if (i == a.length - 1) {
43.                 // 最后一个数组
44.                 String hou_Arrray[] = a[i].split(";");
45.                 // 最后一个的前一个数组
46.                 String qian_Array[] = a[i - 1].split(";");
48.                 System.out.println(a[i]);
49.                 System.out.println(a[i - 1]);
51.                 tempArray = new String[hou_Arrray.length * qian_Array.length];
53.                 int tempint = 0;
55.                 for (int j = 0; j < qian_Array.length; j++) {
56.                     for (int k = 0; k < hou_Arrray.length; k++) {
58.                         // System.out.println(qian_Array[j] + "&" +
59.                         // hou_Arrray[k]);
60.                         tempArray[tempint] = qian_Array[j] + "&"
61.                                 + hou_Arrray[k];
62.                         tempint++;
63.                     }
64.                 }
65.                 System.out.println(tempArray.length);
66.                 for (int j = 0; j < tempArray.length; j++) {
67.                     System.out.println(j);
68.                     System.out.println(tempArray[j]);
69.                 }
70.             } else {
72.                 if (i - 1 != -1) {
73.                     int tempint = 0;
74.                     String qian_Array_1[] = a[i - 1].split(";");
75.                     String temp_1[] = tempArray;
76.                     tempArray = null;
77.                     tempArray = new String[qian_Array_1.length * temp_1.length];
78.                     for (int m = 0; m < qian_Array_1.length; m++) {
79.                         for (int n = 0; n < temp_1.length; n++) {
80.                             tempArray[tempint] = qian_Array_1[m] + "&"
81.                                     + temp_1[n];
82.                             tempint++;
83.                         }
84.                     }
85.                 }
86.             }
87.         }
89.         saveArray = tempArray;
90.         System.out.println(saveArray.length);
91.         
92.         for(int i=0;i<saveArray.length;i++){
93.             System.out.println("要死了："+saveArray[i]);
94.         }
95.         
97.     }
99. }