我的问题与PHP有关
我有2个阵列:
Array1
(
[0] => "Pecan, Blackberry, Peach, Apple, Orange, Banana"
[1] => "Potato, Tomato, Broccoli, Spinach"
[2] => "Cake, Ice-cream, Candy, Jelly, Chocolate"
}
Array2
(
[0] => "Banana"
[1] => "Apple"
[2] => "Peach"
}
我只想将Array2[0]
元素与Array1[0]
匹配,以检查Array2[0]
的值(在这种情况下,它是Banana
)是否存在于元素中是Array1[0]
还是不
尽管如此,我可以解决这个问题,但是我想知道是否存在快速,内存消耗较少的内置函数或其他方式,因为我需要在页面加载时执行此操作10次。
答案 0 :(得分:1)
如果我理解你的问题,这应该是你想要的:
foreach ($array2 as $key => val) {
if (stripos($array1[$key], $val) !== false) {
// match
}
}
答案 1 :(得分:0)
这将找到确切的值(Bananaaaaa与Banana不同)。
<强>代码强>
foreach ($array2 as $key => $val) {
if (in_array($val, explode(', ', $array1[$key]))) {
var_dump("$val is found in \$array1[$key]");
} else {
var_dump("$val is not found in \$array1[$key]");
}
}
<强>输出强>
string(29) "Banana is found in $array1[0]"
string(32) "Apple is not found in $array1[1]"
string(32) "Peach is not found in $array1[2]"