阵列已被全面覆盖,但仍然难以解决如何解决这个问题.我有两个数组,我想合并而不会覆盖重复的键,即
Array1
(
[0] => 0
[1] => 1
[2] => 1
[3] => 1
[4] => 1
[5] => 0
[6] => 0
)
+
Array2
(
[0] => 0
[1] => 0
[2] => 0
[3] => 0
[4] => 0
[5] => 0
[6] => 1
)
Run Code Online (Sandbox Code Playgroud)
我理想的结果是
Array1 + Array2
(
[0] => 0
[1] => 1
[2] => 1
[3] => 1
[4] => 1
[5] => 0
[6] => 1
)
Run Code Online (Sandbox Code Playgroud)
我该怎么办?我尝试过使用+但是它会给出第一个数组作为结果
你想要做的是将两个数组映射到单个数组,包含两个相应值的最大值,如下所示:
$array1 = array(0, 1, 1, 1, 1, 0, 0);
$array2 = array(0, 0, 0, 0, 0, 0, 1);
$result = array_map('max', $array1, $array2);
Run Code Online (Sandbox Code Playgroud)
请在此处查看结果:http://ideone.com/clone/MN568
它看起来像这样:
array(7) {
[0]=>
int(0)
[1]=>
int(1)
[2]=>
int(1)
[3]=>
int(1)
[4]=>
int(1)
[5]=>
int(0)
[6]=>
int(1)
}
Run Code Online (Sandbox Code Playgroud)