java 笛卡尔积 数组,N个数组中所有元素的排列组合（笛卡尔积）算法

(1)N个数组对象中所有元素排列组合算法

private List> combineAlg(List nArray) {

List> values = new LinkedList>();

int[] x = new int[nArray.size()];

for (int i = 0; i < x.length; i++) {

x[i] = 0;

}

int flag = 0;

do {

/**一种组合形式**/

List objs = new LinkedList();

for (int looper = 0; looper < nArray.size(); looper++) {

objs.add(nArray.get(looper)[x[looper]]);

}

flag = NextPermutation(x, nArray);

values.add(objs);

} while (flag != 1);

/**所有组合形式**/

return values;

}

private int NextPermutation(int[] x, List nArray) {

int carry = 0;

for (int looper = nArray.size() - 1; looper >= 0; looper--) {

if (x[looper] + 1 == nArray.get(looper).length) {

carry = 1;

x[looper] = 0;

} else {

x[looper] = x[looper] + 1;

carry = 0;

return 0;

}

}

if (carry == 1)

return 1;

else

return 0;

}