题
嘿所有,基本上,我有一个数组:
array('a', 'b', 'c');
现在我运行它通过阵列置换函数,其结果是:
Array
(
[0] => Array
(
[0] => C
)
[1] => Array
(
[0] => B
)
[2] => Array
(
[0] => B
[1] => C
)
[3] => Array
(
[0] => C
[1] => B
)
[4] => Array
(
[0] => A
)
[5] => Array
(
[0] => A
[1] => C
)
[6] => Array
(
[0] => C
[1] => A
)
[7] => Array
(
[0] => A
[1] => B
)
[8] => Array
(
[0] => B
[1] => A
)
[9] => Array
(
[0] => A
[1] => B
[2] => C
)
[10] => Array
(
[0] => A
[1] => C
[2] => B
)
[11] => Array
(
[0] => B
[1] => A
[2] => C
)
[12] => Array
(
[0] => B
[1] => C
[2] => A
)
[13] => Array
(
[0] => C
[1] => A
[2] => B
)
[14] => Array
(
[0] => C
[1] => B
[2] => A
)
)
现在我的问题是,如何清洁该阵列向上,以便:
array ( C, B )
is the same as
array ( B, C )
和它删除第二阵列
我将如何做呢?
编辑...后根据您的回答一些研究,这是我想出了:
array_walk($array, 'sort');
$array = array_unique($array);
sort($array); // not necessary
解决方案
只需排序构成阵列:
foreach ($arrays AS &$arr)
{
sort($arr);
}
所以{ “C”, “B”}变为=> { “B”, “C”},点击 和{ “B”, “C”}变为=> { “B”, “C”}
,其是相同的。
其他提示
array_multisort($array);
array_unique($array);
您也可以使用梨包 Math_Combinatorics 。
require_once 'Combinatorics.php';
$combinatorics = new Math_Combinatorics;
$a = array('a', 'b', 'c');
// creating and storing the combinations
for($combinations = array(), $n=1; $n<=count($a); $n++) {
$combinations = array_merge($combinations, $combinatorics->combinations($a, $n));
}
// test output
foreach($combinations as $c) {
echo join(', ', $c), "\n";
}
打印
a
b
c
a, b
a, c
b, c
a, b, c
不隶属于 StackOverflow