java 数组的排列组合_java-多个数组排列组合

一. 场景

有多个数组:

["一层","二层","三层"...] , ["圆形","方形"...] ...

排列组合效果:

["一层","圆形"] , ["一层","方形"] , ["二层","圆形"] ...

二. 实现方法

import org.apache.commons.collections4.CollectionUtils;

import org.junit.Test;

import java.util.ArrayList;

import java.util.Arrays;

import java.util.List;

public class ArrayUtils {

/**

* 多个数组排列组合

* @param list 原始list

* @param 数据类型

* @return

*/

private static List> getDescartes(List> list) {

List> returnList = new ArrayList<>();

descartesRecursive(list, 0, returnList, new ArrayList());

return returnList;

}

/**

* 递归实现

* 原理：从原始list的0开始依次遍历到最后

*

* @param originalList 原始list

* @param position 当前递归在原始list的position

* @param returnList 返回结果

* @param cacheList 临时保存的list

*/

private static void descartesRecursive(List> originalList, int position, List> returnList, List cacheList) {

List originalItemList = originalList.get(position);

for (int i = 0; i < originalItemList.size(); i++) {

//最后一个复用cacheList，节省内存

List childCacheList = (i == originalItemList.size() - 1) ? cacheList : new ArrayList<>(cacheList);

childCacheList.add(originalItemList.get(i));

if (position == originalList.size() - 1) {//遍历到最后退出递归

returnList.add(childCacheList);

continue;

}

descartesRecursive(originalList, position + 1, returnList, childCacheList);

}

}

/**

* 多个数组排列组合

* @param list 原始list

* @return

*/

public static List getPermutations(List> list) {

List resultList = new ArrayList<>();

List> list1 = getDescartes(list);

if(CollectionUtils.isNotEmpty(list1)){

list1.forEach(temp->{

String str = listToStr(temp);

if (StringUtil.notEmpty(str)) {

resultList.add(listToStr(temp));

}

});

}

return resultList;

}

public static String listToStr(List list){

StringBuffer str = new StringBuffer();

if(CollectionUtils.isNotEmpty(list)){

list.forEach(temp->{

str.append("[").append(temp).append("]");

});

}

return str.toString();

}

}

测试1

@Test

public void test1(){

List list1 = Arrays.asList("一层", "二层", "三层");

List list2 = Arrays.asList("圆形", "方形");

ArrayList> list3 = new ArrayList<>();

list3.add(list1);

list3.add(list2);

List descartes = getPermutations(list3);

descartes.forEach(System.out::println);

}

输出

[一层][圆形]

[一层][方形]

[二层][圆形]

[二层][方形]

[三层][圆形]

[三层][方形]

测试2

@Test

public void test2(){

List list1 = Arrays.asList("一层", "二层", "三层");

List list2 = Arrays.asList("圆形", "方形");

ArrayList> list3 = new ArrayList<>();

list3.add(list1);

list3.add(list2);

List> descartes = getDescartes(list3);

descartes.forEach(System.out::println);

}

输出

[一层, 圆形]

[一层, 方形]

[二层, 圆形]

[二层, 方形]

[三层, 圆形]

[三层, 方形]