兩個數(shù)組之間的差異我有兩個數(shù)組。我想要這兩個數(shù)組之間的區(qū)別。也就是說，如何找到兩個數(shù)組中不存在的值？ $array1=Array ( [0] => 64 [1] => 98 [2] => 112 [3] => 92 [4] => 92 [5] => 92 ) ;
$array2=Array ( [0] => 3 [1] => 26 [2] => 38 [3] => 40 [4] => 44 [5] => 46 [6] => 48 [7] => 52 [8] => 64 [9] => 68 [10] => 70 [11] => 72 [12] => 102 [13] => 104 [14] => 106 [15] => 92 [16] => 94 [17] => 96 [18] => 98 [19] => 100 [20] => 108 [21] => 110 [22] => 112);
3 回答
慕村9548890
TA貢獻1884條經(jīng)驗 獲得超4個贊
注意：這個答案將返回$ array2中$ array1中不存在的值，它不會返回$ array1中不在$ array2中的值。
$diff = array_diff($array2, $array1);
慕婉清6462132
TA貢獻1804條經(jīng)驗 獲得超2個贊
如果要以遞歸方式獲取數(shù)組之間的差異，請嘗試以下函數(shù)：
function arrayDiffRecursive($firstArray, $secondArray, $reverseKey = false){
$oldKey = 'old';
$newKey = 'new';
if ($reverseKey) {
$oldKey = 'new';
$newKey = 'old';
}
$difference = [];
foreach ($firstArray as $firstKey => $firstValue) {
if (is_array($firstValue)) {
if (!array_key_exists($firstKey, $secondArray) || !is_array($secondArray[$firstKey])) {
$difference[$oldKey][$firstKey] = $firstValue;
$difference[$newKey][$firstKey] = '';
} else {
$newDiff = arrayDiffRecursive($firstValue, $secondArray[$firstKey], $reverseKey);
if (!empty($newDiff)) {
$difference[$oldKey][$firstKey] = $newDiff[$oldKey];
$difference[$newKey][$firstKey] = $newDiff[$newKey];
}
}
} else {
if (!array_key_exists($firstKey, $secondArray) || $secondArray[$firstKey] != $firstValue) {
$difference[$oldKey][$firstKey] = $firstValue;
$difference[$newKey][$firstKey] = $secondArray[$firstKey];
}
}
}
return $difference;}測試：
$differences = array_replace_recursive( arrayDiffRecursive($firstArray, $secondArray), arrayDiffRecursive($secondArray, $firstArray, true));var_dump($differences);
- 3 回答
- 0 關(guān)注
- 726 瀏覽
添加回答
舉報
0/150
提交
取消