Php 如何在多维数组中搜索父键
我试图搜索一个多维数组,当我搜索一个值时,它应该返回它的父键。数组如下所示:Php 如何在多维数组中搜索父键,php,arrays,multidimensional-array,Php,Arrays,Multidimensional Array,我试图搜索一个多维数组,当我搜索一个值时,它应该返回它的父键。数组如下所示: [ "fruits" => [ "sweet" => [ "apple", "banana", ], "citrus" => [ "lemon", "orange", ] ], "vegetables" => [ "leafy" => [ "spinach
[
"fruits" => [
"sweet" => [
"apple",
"banana",
],
"citrus" => [
"lemon",
"orange",
]
],
"vegetables" => [
"leafy" => [
"spinach",
"broccoli",
]
],
]
当我搜索花椰菜时,我希望函数返回leafy
,或者如果我搜索leafy
,则它应该返回蔬菜
,但此函数始终返回我null
:
function recursiveFind(array $haystack, $needle)
{
$foundKey = null;
foreach ($haystack as $key => $value) {
if(is_array($value)) {
if(in_array($needle, $value)){
return $key;
} else {
$foundKey = recursiveFind($value, $needle);
}
}
}
return $foundKey;
}
我尝试的另一个函数如下,它总是返回我false
:
function recursiveFind(array $haystack, $needle)
{
foreach($haystack as $key => $value) {
$current_key = $key;
if($needle === $value || (is_array($value) && recursiveFind($value, $needle) !== false)) {
return $current_key;
}
}
return false;
}
当只有第二个级别时,上述功能可以工作,例如,如果我们移除水果和蔬菜包装
function recursiveFind(array $haystack, $needle)
{
foreach($haystack as $key => $data){
foreach($data as $k=>$v){
if($needle==$k){
return $key;
}
if(in_array($needle, $v)){
return $k;
}
}
}
return null;
}
按照您在备注中指定的要求-
public $needle = 'citrus';
private function recursiveFind($haystack, $prev)
{
foreach ($haystack as $key => $data) {
if (is_array($data) && in_array($this->needle, $data)) {
return $key;
}
if ($this->needle === $key) {
return $prev;
}
if (is_array($data)) {
$result = $this->recursiveFind($data, $key);
if ($result != null)
return $result;
}
}
return null;
}
把这叫做-
$value = $this->recursiveFind($data, null);
return $value;
请注意,我已将$needle
声明为类变量。您现在可以根据需要设置此字段
Happy Coding :)
按照您在备注中指定的要求-
public $needle = 'citrus';
private function recursiveFind($haystack, $prev)
{
foreach ($haystack as $key => $data) {
if (is_array($data) && in_array($this->needle, $data)) {
return $key;
}
if ($this->needle === $key) {
return $prev;
}
if (is_array($data)) {
$result = $this->recursiveFind($data, $key);
if ($result != null)
return $result;
}
}
return null;
}
把这叫做-
$value = $this->recursiveFind($data, null);
return $value;
请注意,我已将$needle
声明为类变量。您现在可以根据需要设置此字段
Happy Coding :)
请检查此更新代码
<?php
$data = [
"fruits" => [
"sweet" => [
"apple",
"banana",
],
"citrus" => [
"lemon",
"orange",
]
],
"vegetables" => [
"leafy" => [
"spinach",
"broccoli",
]
],
];
function recursiveFind(array $datas, $needle) {
foreach ($datas as $key => $data) {
foreach ($data as $inx => $stx) {
if ($needle == $inx) {
return $key;
}
if (in_array($needle, $stx)) {
return $inx;
}
}
}
return null;
}
echo $parentkey = recursiveFind($data, 'broccoli'); // output: leafy
echo $parentkey = recursiveFind($data, 'leafy'); // output: vegetables
?>
请检查此更新的代码
<?php
$data = [
"fruits" => [
"sweet" => [
"apple",
"banana",
],
"citrus" => [
"lemon",
"orange",
]
],
"vegetables" => [
"leafy" => [
"spinach",
"broccoli",
]
],
];
function recursiveFind(array $datas, $needle) {
foreach ($datas as $key => $data) {
foreach ($data as $inx => $stx) {
if ($needle == $inx) {
return $key;
}
if (in_array($needle, $stx)) {
return $inx;
}
}
}
return null;
}
echo $parentkey = recursiveFind($data, 'broccoli'); // output: leafy
echo $parentkey = recursiveFind($data, 'leafy'); // output: vegetables
?>
如果没有第二个foreach,也可以执行'@AlivetoDie,请使用递归函数尝试此操作:echo$parentkey=recursiveFind($array,'banana');//输出:leafy echo$parentkey=recursiveFind($array,'leafy');//输出:蔬菜输出将不同,这与@sohel0415没有秒foreach一样。也可以执行“@AlivetoDie,请使用递归函数尝试此操作:echo$parentkey=recursiveFind($array,'banana');//输出:leafy echo$parentkey=recursiveFind($array,'leafy');//输出:蔬菜输出将不同于我们的预期这与@SOHEL0415相同这返回false
这返回false
这效果很好,但如果我为例如添加新的级别:'spinach'=>['leaves']
,它将失败。您可以在循环内进行另一次检查,我只是尝试解决当前的问题,如果您正在寻找更具动态性的内容,请在内部循环一次又一次循环,然后您需要在内部搜索一次又一次。我将尝试以递归的方式更新这个答案。我的意思是它应该根据数组的深度进行调整。。这正是我试图实现的目标…感谢编辑,我会看一看,然后再回复你..这很好,但如果我为例如添加新的级别:“菠菜”=>['leaves']
,那么它就失败了。你可以在循环内进行另一次检查,我只是尝试解决当前的问题,如果你正在寻找更动态的东西,循环内部循环一次又一次循环,然后您需要一次又一次地搜索内部。我将尝试以递归的方式更新这个答案。我的意思是它应该根据数组的深度进行调整。。这正是我试图实现的目标…感谢编辑,我将查看此内容并返回给您。@AlivetoDie您删除了答案。。是的,我的答案不正确completely@AlivetoDie你删除了答案?是的,我的答案不完全正确