获得三个数组的所有可能组合,没有重复

Question

我有三个动态填充的数组.有可能只有一个或两个数组有数据.

$array1 = array(
    [0] => 100GB
    [1] => 500GB
)

$array2 = array(
    [0] => black
    [1] => yellow
    [2] => green
)

$array1 = array(
    [0] => 2.5"
)

不,我需要将它们组合成一个包含所有可能变化的新数组

$variations = array(
    [0] => 100GB - black - 2.5"
    [1] => 100GB - yellow - 2.5"
    [2] => 100GB - green - 2.5"
    [3] => 500GB - black - 2.5"
    [4] => 500GB - yellow - 2.5"
    [5] => 500GB - green - 2.5"
)

直到现在我还没有办法做到这一点.有人可以帮帮我吗？

先感谢您

Answer 1

您可以使用foreach循环轻松实现此目的:

$array1 = array('100GB', '500GB');
$array2 = array('black', 'yellow', 'green');
$array3 = array('2.5');

$combinations = array();
foreach ($array1 as $i) {
  foreach ($array2 as $j) {
    foreach ($array3 as $k) {
      $combinations[] = $i.' - '.$j.' - '.$k;
    }
  }
}

echo implode("\n", $combinations);

编辑:要处理空数组,您可以使用此函数:

function combinations($arrays, $i = 0) {
    if (!isset($arrays[$i])) {
        return array();
    }
    if ($i == count($arrays) - 1) {
        return $arrays[$i];
    }

    // get combinations from subsequent arrays
    $tmp = combinations($arrays, $i + 1);

    $result = array();

    // concat each array from tmp with each element from $arrays[$i]
    foreach ($arrays[$i] as $v) {
        foreach ($tmp as $t) {
            $result[] = is_array($t) ? 
                array_merge(array($v), $t) :
                array($v, $t);
        }
    }

    return $result;
}

这个功能取自这个答案,所以归功于作者.然后,您可以这样调用此combinations函数:

$array1 = array('100GB', '500GB');
$array2 = array();
$array3 = array('2.5');

$arrays = array_values(array_filter(array($array1, $array2, $array3)));
$combinations = combinations($arrays);

foreach ($combinations as &$combination) {
  $combination = implode(' - ', $combination);
}

echo implode("\n", $combinations);

这输出:

100GB - 2.5
500GB - 2.5