有一数组:<?php
$arr = array(array(1,0),array(2,0),array(3,0),array(4,0),array(5,1),array(6,1),array(7,5),array(8,2)); ?>想要排序的结果为:<?php
$arr = array(array(1,0),array(5,1),array(7,5),array(6,1),array(2,0),array(8,2),array(3,0),array(4,0)); ?>即:$arr[$i][0] == $arr[$j][1] 那么$arr[$j]放在$arr[$i]后面其实就是一个无限分类的一个排序,我试过多个循环来处理,不过有点麻烦,想用递归来实现,只实现了$arr[$i][0]=1的情况,请大家帮忙
分类比较少,就这么多了
$arr = array(array(1,0),array(2,0),array(3,0),array(4,0),array(5,1),array(6,1),array(7,5),array(8,2)); ?>想要排序的结果为:<?php
$arr = array(array(1,0),array(5,1),array(7,5),array(6,1),array(2,0),array(8,2),array(3,0),array(4,0)); ?>即:$arr[$i][0] == $arr[$j][1] 那么$arr[$j]放在$arr[$i]后面其实就是一个无限分类的一个排序,我试过多个循环来处理,不过有点麻烦,想用递归来实现,只实现了$arr[$i][0]=1的情况,请大家帮忙
分类比较少,就这么多了
$r = array();
foreach($ar as $v) {
if($v[1] == $p) {
$r[] = $v;
$r = array_merge($r, foo($ar, $v[0]));
}
}
return $r;
}Array
(
[0] => Array
(
[0] => 1
[1] => 0
) [1] => Array
(
[0] => 5
[1] => 1
) [2] => Array
(
[0] => 7
[1] => 5
) [3] => Array
(
[0] => 6
[1] => 1
) [4] => Array
(
[0] => 2
[1] => 0
) [5] => Array
(
[0] => 8
[1] => 2
) [6] => Array
(
[0] => 3
[1] => 0
) [7] => Array
(
[0] => 4
[1] => 0
))