简单算法记录

// 根据数组有多少组来进行全排列组合
    private static List<String> changeGroup(List<List<String>> group) {
        List<String[]> groupStrs = new ArrayList<>();
        List<String> temp = new ArrayList<>();
        List<String> result = new ArrayList<>();
        //例如: 从三个数组中各取一个元素，列出所有可能结果
        groupRecombination(group, temp, 0, groupStrs);
        for (String[] str : groupStrs) {
            result.add(StringUtils.join(str, ","));
        }
        return result;
    }

    // 多数组数据重组 [{"a","b","c"},{"d","e"}]-->[{"a","d"},{"a","e"},{"b","d"},{"b","e"},{"c","d"},{"c","e"}]
    public static void groupRecombination(List<List<String>> list, List<String> temp, int n, List<String[]> result) {
        if (n < list.size()) {
            for (int i = 0; i < list.get(n).size(); i++) {
                if (n < list.size() - 1) {
                    temp.add(list.get(n).get(i));
                    groupRecombination(list, temp, n + 1, result);
                } else if (n == list.size() - 1) {
                    temp.add(list.get(n).get(i));
                    String[] cc = new String[temp.size()];
                    cc = temp.toArray(new String[0]);
                    Arrays.sort(cc);
                    result.add(cc);
                }
                temp.remove(n);
            }
        }
    }

    // 单数组重排，{"a","b","c"} num:新数组里面每一组该有几个元素，例子：2  ----> [{"a","b"},{"a","c"},{"b","c"}]
    public static <T> List<List<T>> combination(List<T> values, int num) {
        if (0 == num) {
            return Collections.singletonList(Collections.<T>emptyList());
        }
        if (values.isEmpty()) {
            return Collections.emptyList();
        }
        List<List<T>> combination = new LinkedList<>();
        T actual = values.iterator().next();
        List<T> subSet = new LinkedList<>(values);
        subSet.remove(actual);
        List<List<T>> subSetCombination = combination(subSet, num - 1);
        for (List<T> set : subSetCombination) {
            List<T> newSet = new LinkedList<>(set);
            newSet.add(0, actual);
            combination.add(newSet);
        }
        combination.addAll(combination(subSet, num));
        return combination;
    }

    // 字符串的组合，组合的长度小于等于num数值
    public static List<String> permutation(List<String> list, int num, String device) {
        List<List<String>> powerSet = new LinkedList<>();
        List<String> iList = new ArrayList<>();
        iList.add(device);
        if (num >= 2) {
            for (int i = 1; i <= num - 1; i++) {
                powerSet.addAll(combination(list, i));
            }
        }
        for (List<String> str : powerSet) {
            str.add(device);
            Collections.sort(str, (o1, o2) -> o1.compareTo(o2));
            iList.add(StringUtils.join(str, ","));
        }
        return iList;
    }