嘿所有,基本上,我有一个数组:
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
答案 0 :(得分:3)
只需sort组成数组:
foreach ($arrays AS &$arr)
{
sort($arr);
}
所以{“C”,“B”}变为=> {“B”,“C”}
和{“B”,“C”}成为=> {“B”,“C”}
是完全相同的。
答案 1 :(得分:3)
array_multisort($array);
array_unique($array);
答案 2 :(得分:1)
您也可以使用梨包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