查找所有數(shù)組中存在的值的最快方法是什么。$arrayOfArrays[] = [76,964,34,66775,3,88,99,69];$arrayOfArrays[] = [69,55,65,657,436,6345,8654];$arrayOfArrays[] = [54,543,496,3455,47556,69,234,436557];$arrayOfArrays[] = [4564536,4543,777,3445,43768,2334,69,35,574];預(yù)期輸出為[69]
2 回答
天涯盡頭無(wú)女友
TA貢獻(xiàn)1831條經(jīng)驗(yàn) 獲得超9個(gè)贊
使用數(shù)組相交
$arrayOfArrays[] = [76,964,34,66775,3,88,99,69];
$arrayOfArrays[] = [69,55,65,657,436,6345,8654];
$arrayOfArrays[] = [54,543,496,3455,47556,69,234,436557];
$arrayOfArrays[] = [4564536,4543,777,3445,43768,2334,69,35,574];
$intersect = array_intersect(
? ? $arrayOfArrays[0],$arrayOfArrays[1],$arrayOfArrays[2],$arrayOfArrays[3]
);
$arrayOfArrays[] = [76,964,34,66775,3,88,99,69];
$arrayOfArrays[] = [69,55,65,657,436,6345,8654];
$arrayOfArrays[] = [54,543,496,3455,47556,69,234,436557];
$arrayOfArrays[] = [4564536,4543,777,3445,43768,2334,69,35,574];
$intersect = call_user_func_array('array_intersect', $arrayOfArrays);
森林海
TA貢獻(xiàn)2011條經(jīng)驗(yàn) 獲得超2個(gè)贊
$arrayOfArrays[] = [76,964,34,66775,3,88,99,69];
$arrayOfArrays[] = [69,55,65,657,436,6345,8654];
$arrayOfArrays[] = [54,543,496,3455,47556,69,234,436557];
$arrayOfArrays[] = [4564536,4543,777,3445,43768,2334,69,35,574];
$result = call_user_func_array('array_intersect', $arrayOfArrays);
- 2 回答
- 0 關(guān)注
- 180 瀏覽
添加回答
舉報(bào)
0/150
提交
取消