在数组中找到所有可能的子集组合? [英] Find all possible subset combos in an array?

问题描述

我需要使用最少 2 项和未知最大值来获取数组的所有可能子集.谁能帮我一下?

假设我有以下数组:

[1, 2, 3]

我如何得到这个?

<预><代码>[[1, 2],[1, 3],[2, 3],[1, 2, 3]]

解决方案

窃取后 这个 JavaScript 组合生成器，我添加了一个参数来提供导致的最小长度，

var combine = function(a, min) {var fn = function(n, src, got, all) {如果(n == 0){如果(得到.长度> 0){all[all.length] = got;}返回;}for (var j = 0; j 

要使用，请提供一个数组和所需的最小子集长度，

var 子集 = combine([1, 2, 3], 2);

输出是，

[[1, 2], [1, 3], [2, 3], [1, 2, 3]]

I need to get all possible subsets of an array with a minimum of 2 items and an unknown maximum. Anyone that can help me out a bit?

Say I have the following array:

[1, 2, 3]

How do I get this?

[
    [1, 2],
    [1, 3],
    [2, 3],
    [1, 2, 3]
]

解决方案

After stealing this JavaScript combination generator, I added a parameter to supply the minimum length resulting in,

var combine = function(a, min) {
    var fn = function(n, src, got, all) {
        if (n == 0) {
            if (got.length > 0) {
                all[all.length] = got;
            }
            return;
        }
        for (var j = 0; j < src.length; j++) {
            fn(n - 1, src.slice(j + 1), got.concat([src[j]]), all);
        }
        return;
    }
    var all = [];
    for (var i = min; i < a.length; i++) {
        fn(i, a, [], all);
    }
    all.push(a);
    return all;
}

To use, supply an array, and the minimum subset length desired,

var subsets = combine([1, 2, 3], 2);

Output is,

[[1, 2], [1, 3], [2, 3], [1, 2, 3]]

这篇关于在数组中找到所有可能的子集组合?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！