array_unique(array) 只能處理value只有單個的數組。php
去除有多個value數組,可使用以下函數實現:數組
function more_array_unique($arr=array()){ foreach($arr[0] as $k => $v){ $arr_inner_key[]= $k; //先把二維數組中的內層數組的鍵值記錄在在一維數組中 } foreach ($arr as $k => $v){ $v =join(",",$v); //降維 用implode()也行 $temp[$k] =$v; //保留原來的鍵值 $temp[]即爲不保留原來鍵值 } $temp =array_unique($temp); //去重:去掉重複的字符串 foreach ($temp as $k => $v){ $a = explode(",",$v); //拆分後的重組 如:Array( [0] => james [1] => 30 ) $arr_after[$k]= array_combine($arr_inner_key,$a); //將原來的鍵與值從新合併 } return $arr_after; }
有以下數組:函數
$arr = array( '0'=>array( 'name'=>'james', 'age'=>30, ), '1'=>array( 'name'=>'susu', 'age'=>26, ), '2'=>array( 'name'=>'james', 'age'=>30, ), 'new'=>array( 'name'=>'kube', 'age'=>37, ), 'list'=>array( 'name'=>'kube', 'age'=>27, ), '435'=>array( 'name'=>'susu', 'age'=>26, ), '33'=>array( 'name'=>'james', 'age'=>30, ), );
調用函數後顯示:測試
Array ( [0] => Array ( [name] => james [age] => 30 ) [1] => Array ( [name] => susu [age] => 26 ) [new] => Array ( [name] => kube [age] => 37 ) [list] => Array ( [name] => kube [age] => 27 ) )
測試Demo以下:字符串
<?php $arr = array( '0'=>array( 'name'=>'james', 'age'=>30, ), '1'=>array( 'name'=>'susu', 'age'=>26, ), '2'=>array( 'name'=>'james', 'age'=>30, ), 'new'=>array( 'name'=>'kube', 'age'=>37, ), 'list'=>array( 'name'=>'kube', 'age'=>27, ), '435'=>array( 'name'=>'susu', 'age'=>26, ), '33'=>array( 'name'=>'james', 'age'=>30, ), ); printf("原來的數組:<br><pre>"); //輸出原來的數組 print_r($arr); echo "</pre><br/>"; function more_array_unique($arr=array()){ foreach($arr[0] as $k => $v){ $arr_inner_key[]= $k; //先把二維數組中的內層數組的鍵值記錄在在一維數組中 } foreach ($arr as $k => $v){ $v =join(",",$v); //降維 用implode()也行 $temp[$k] =$v; //保留原來的鍵值 $temp[]即爲不保留原來鍵值 } $temp =array_unique($temp); //去重:去掉重複的字符串 foreach ($temp as $k => $v){ $a = explode(",",$v); //拆分後的重組 如:Array( [0] => james [1] => 30 ) $arr_after[$k]= array_combine($arr_inner_key,$a); //將原來的鍵與值從新合併 } return $arr_after; } $arr_new = more_array_unique($arr); //調用去重函數 printf("去除重複元素後的數組:<br>"); echo '<pre>'; print_r($arr_new); echo "</pre><br/>"; ?>