首頁(yè) 猿問(wèn) PHP數(shù)組的合并處理

PHP數(shù)組的合并處理

JavaScript

呼啦一陣風(fēng) 2019-04-08 11:18:28

有兩個(gè)數(shù)組：===========A:array([0]=>Array([Vtime]=>2014-01-1800:22:43[qr]=>0a5500f5d5e5847209d83a7fe637a34f)[1]=>Array([Vtime]=>2014-01-1700:00:00[qr]=>218e412b1d73f771e8b01b9d1f678f5b))===========B:array([0]=>Array([Date]=>2014-01-1800:22:43[Md5]=>0a5500f5d5e5847209d83a7fe637a34f)[1]=>Array([Date]=>2014-01-1800:22:43[Md5]=>218e412b1d73f771e8b01b9d1f678f5b)[2]=>Array([Date]=>2014-01-1700:00:00[Md5]=>218e412b1d73f771e8b01b9d1f678f5b)[3]=>Array([Date]=>2014-01-1700:00:00[Md5]=>218e412b1d73f771e8b01b9d1f678f5b)[4]=>Array([Date]=>2014-01-1700:00:00[Md5]=>218e412b1d73f771e8b01b9d1f678f5b))比較A數(shù)組Vtime和B數(shù)組中的Date是否相同，如果相同將數(shù)據(jù)合并(vtime,qr,Date,Md5)放到C數(shù)組，如果不相同，則單獨(dú)把A數(shù)組放到C數(shù)組。(A數(shù)組要和B數(shù)組的每一個(gè)都對(duì)比，B數(shù)組只有和A數(shù)組對(duì)應(yīng)的才會(huì)保留到C數(shù)組)求高手幫我想個(gè)辦法。

查看完整描述

2 回答

POPMUISE

TA貢獻(xiàn)1765條經(jīng)驗(yàn) 獲得超5個(gè)贊

$A=array(array('Vtime'=>1,'qr'=>2,),array('Vtime'=>3,'qr'=>4,),);$B=array(array('date'=>1,'md5'=>2,),array('date'=>5,'md5'=>6,),);$D=array();foreach($Bas$b){//沒(méi)有考慮date重復(fù)的問(wèn)題$D[$b['date']]=$b;}$C=$A;foreach($Cas&$c){if(isset($D[$c['Vtime']])){$c=array_merge($c,$D[$c['Vtime']]);}}unset($c);var_dump($C);

反對(duì) 回復(fù) 2019-04-08

大話西游666

TA貢獻(xiàn)1817條經(jīng)驗(yàn) 獲得超14個(gè)贊

$A=array();//初始數(shù)據(jù)$A$B=array();//初始數(shù)據(jù)$B$D=array();foreach($Bas$b){$D['date'][]=$b['Date'];$D['md5'][]=$b['Md5'];}$D=array_combine($D['date'],$D['md5']);foreach($Aas&$a)array_key_exists($a['Vtime'],$D)&&$a['md5']=$D[$a['Vtime']];$C=$A;