考虑一个m维php数组,如下所示:
print_r($arr)
Array (
[0] => Array ( [stimid] => 6 [list] => L01 )
[1] => Array ( [stimid] => 3 [list] => L01 )
[2] => Array ( [stimid] => 2 [list] => L02 )
[3] => Array ( [stimid] => 5 [list] => L02 )
[4] => Array ( [stimid] => 1 [list] => L03 )
[5] => Array ( [stimid] => 4 [list] => L03 )
)
注意'stimid'元素是随机顺序的,而'list'元素是升序的。我只是简单地对这个数组进行洗牌,使"列表"元素保持连续。例如,我希望新数组的顺序是:
print_r($new_arr)
Array (
[0] => Array ( [stimid] => 1 [list] => L03 )
[1] => Array ( [stimid] => 4 [list] => L03 )
[2] => Array ( [stimid] => 3 [list] => L01 )
[3] => Array ( [stimid] => 6 [list] => L01 )
[4] => Array ( [stimid] => 2 [list] => L02 )
[5] => Array ( [stimid] => 5 [list] => L02 )
)
还要注意,每个'list'类型中的行顺序不需要保持顺序。
这可能是一个非常简单的问题,但我似乎无法解决它!任何帮助都是感激的。
不美观也不高效但是:
$input = Array (
0 => Array ( 'stimid' => 6, 'list' => L01 ),
1 => Array ( 'stimid' => 3, 'list' => L01 ),
2 => Array ( 'stimid' => 2, 'list' => L02 ),
3 => Array ( 'stimid' => 5, 'list' => L02 ),
4 => Array ( 'stimid' => 1, 'list' => L03 ),
5 => Array ( 'stimid' => 4, 'list' => L03 ),
);
shuffle($input);
$list = array();
foreach ($input as $pos => $item)
{
$list[ $item['list'] ][] = $item;
}
$out = array();
foreach ($list as $item)
{
$out = array_merge($item, $out);
}
print_r($out);
输出:Array
(
[0] => Array
(
[stimid] => 1
[list] => L03
)
[1] => Array
(
[stimid] => 4
[list] => L03
)
[2] => Array
(
[stimid] => 5
[list] => L02
)
[3] => Array
(
[stimid] => 2
[list] => L02
)
[4] => Array
(
[stimid] => 3
[list] => L01
)
[5] => Array
(
[stimid] => 6
[list] => L01
)
)
你可以这样做:
$new_arr = deep_shuffle_array($arr);
print_r($new_arr);
function deep_shuffle_array(array $array){
foreach($array as $k => $v){
shuffle($v);
$new_array[$k] = $v;
}
return $new_array;
}
function cmp($a, $b) {
if ($a['stimid'] == $b['stimid']) {
return 0;
}
return ($a['stimid'] < $b['stimid']) ? -1 : 1;
}
uasort($array, 'cmp');