php遍历追加数组问题

[qq_15621449]

数组1
$arr1 = array(
array('uid'=>1,'times'=>'2014-02-25','counts'=>'19'),
array('uid'=>2,'times'=>'2014-02-26','counts'=>'17'),
array('uid'=>3,'times'=>'2014-02-27','counts'=>'6')
);
数组2
$arr2 = array(
array('id'=>1,'uid'=>1,'times'=>'2014-02-25','counts'=>'19'),
array('id'=>2,'uid'=>1,'times'=>'2014-02-26','counts'=>'17'),
array('id'=>3,'uid'=>1,'times'=>'2014-02-27','counts'=>'16'),
array('id'=>4,'uid'=>3,'times'=>'2014-02-28','counts'=>'18'),
array('id'=>5,'uid'=>1,'times'=>'2014-02-28','counts'=>'15'),
array('id'=>6,'uid'=>4,'times'=>'2014-02-28','counts'=>'14'),
array('id'=>7,('uid'=>4,'times'=>'2014-02-28','counts'=>'13'),
array('id'=>8,'uid'=>1,'times'=>'2014-02-28','counts'=>'12'),
array('id'=>9,'uid'=>1,'times'=>'2014-02-28','counts'=>'11'),
array('id'=>10,'uid'=>3,'times'=>'2014-02-28','counts'=>'10')
);
最后生成一个这样的数组
Array
(
[0] => Array
(
[arr1] => Array
(
array('id'=>1,'times'=>'2014-02-25','counts'=>'19'),
)
[arr2] => Array
(
array('id'=>1,'uid'=>1,'times'=>'2014-02-25','counts'=>'19'),
array('id'=>2,'uid'=>1,'times'=>'2014-02-26','counts'=>'17'),
array('id'=>3,'uid'=>1,'times'=>'2014-02-27','counts'=>'16'),
)
)
[1] => Array
(
[arr1] => Array
(
array('id'=>2,'times'=>'2014-02-26','counts'=>'17'),
)
[arr2] => Array
(
array('id'=>5,'uid'=>1,'times'=>'2014-02-28','counts'=>'15'),
array('id'=>8,'uid'=>1,'times'=>'2014-02-28','counts'=>'12'),
array('id'=>9,'uid'=>1,'times'=>'2014-02-28','counts'=>'11'),
)
)
[2] => Array
(
[arr1] => Array
(
array('id'=>3,'times'=>'2014-02-27','counts'=>'6')
)
[arr2] => Array
(
array('id'=>4,'uid'=>3,'times'=>'2014-02-28','counts'=>'18'),
array('id'=>10,'uid'=>3,'times'=>'2014-02-28','counts'=>'10'),
array('id'=>6,'uid'=>4,'times'=>'2014-02-28','counts'=>'14'),
)
)
)
用数组2的uid匹配数组1中的uid，如果数组2中的uid和数组1中的uid相同的话，就让数组2中的信息放在数组1中，数组1中每个子数组下最多只放3条数组2的记录，如果数组2中相同uid>3时，就只显示3条，所有多余的放进一个新数组里，党相同的不足3条或没有时，就用这个去填充，必须每个下面都是3条记录，数组1下面的记录不能有重复的，昨天描述不请，追加了下描述，请版主大人和大神们帮帮忙看下
应用场景，我从库里取20条公司，又取100调信息，想用信息的uid匹配当前显示的20条公司，如果信息属于该公司就在该公司下面显示，剩下的信息按更新时间倒序,满足每个公司下面3条信息

[qq_34921650]

建议试一下array_merge_recursive 递归处理