要求是这样：找出一段数组中3个值相加等于10的所有组合
/**
* 列阵组合
* @param string $a 列阵数组
* @param mixed $m 阵长
* @return array
*/
function arrangement($a, $m) {
$r = array();
$n = count($a);
if ($m <= 0 || $m > $n) {
return $r;
}
for ($i=0; $i<$n; $i++) {
$b = $a;
$t = array_splice($b, $i, 1);
if ($m == 1) {
$r[] = $t;
} else {
$c = arrangement($b, $m-1);
foreach ($c as $v) {
$r[] = array_merge($t, $v);
}
}
}
return $r;
}
/**
* 开始比较
* @param string $s 阵长度
* @param mixed $number 确认值
* @return array
* @author L
*/
function algorithm($s=3, $number=10) {
$array = [1,2,3,4,5,6,7,8,9];
$array = arrangement($array, $s);
$data = [];
foreach ($array as $val) {
asort($val);
$num = 0;
$key = '';
foreach ($val as $v) {
$key .= $v;
$num += $v;
}
if ($num == $number) {
$data[$key] = $val;
}
}
return $data;
}
echo '<pre>';
$data = algorithm();
var_dump($data);```
输出结果为：
```array(4) {
[127]=>
array(3) {
[2]=>
int(1)
[1]=>
int(2)
[0]=>
int(7)
}
[136]=>
array(3) {
[2]=>
int(1)
[1]=>
int(3)
[0]=>
int(6)
}
[145]=>
array(3) {
[2]=>
int(1)
[1]=>
int(4)
[0]=>
int(5)
}
[235]=>
array(3) {
[2]=>
int(2)
[1]=>
int(3)
[0]=>
int(5)
}
}```
希望各位看官评鉴。小弟技术就这样，求轻喷
