orh*_*isu 4 php recursion foreach return break
我有一个递归函数,如下所示.
public function findnodeintree($cats,$cat_id)
{
foreach($cats as $node)
{
if((int)$node['id'] == $cat_id)
{
echo "finded";
$finded = $node;
break;
}
else
{
if(is_array($node) && array_key_exists('children', $node)){
$this->findnodeintree($node['children'],$cat_id);
}
}
}
return $finded;
}
Run Code Online (Sandbox Code Playgroud)
例如
$node =$this->findnodeintree($category_Array, 169);
Run Code Online (Sandbox Code Playgroud)
它让我高兴
"founded"
Run Code Online (Sandbox Code Playgroud)
遇到PHP错误
Severity: Notice
Message: Undefined variable: finded
Run Code Online (Sandbox Code Playgroud)
数组结构就像
[0] => Array
(
[id] => 0
[name] => MAIN CATEGORY
[depth] => 0
[lft] => 1
[rgt] => 296
[children] => Array
(
[0] => Array
(
[id] => 167
[name] => CAT 0
[depth] => 1
[lft] => 2
[rgt] => 17
[children] => Array
(
[0] => Array
(
[id] => 169
[name] => CAT 1
[depth] => 2
[lft] => 3
[rgt] => 4
)
[1] => Array
(
[id] => 170
[name] => CAT 2
[depth] => 2
[lft] => 5
[rgt] => 10
[children] => Array
(
[0] => Array
(
[id] => 171
[name] => CAT 5
[depth] => 3
[lft] => 6
[rgt] => 7
)
[1] => Array
(
[id] => 172
[name] => CAT 3
[depth] => 3
[lft] => 8
[rgt] => 9
)
)
)
Run Code Online (Sandbox Code Playgroud)
要从递归中获取正确的值,您的递归调用不得丢弃返回值.而且,既然你想要在命中后立即返回递归树,并且实际上返回匹配节点,那么你也必须在那时打破你的循环.
否则后续的递归调用会覆盖您的变量和错误的节点false,或者null返回.
这应该是有效的:
public function findnodeintree($cats,$cat_id)
{
foreach($cats as $node)
{
if((int)$node['id'] == $cat_id){
return $node;
}
elseif(array_key_exists('children', $node)) {
$r = $this->findnodeintree($node['children'], $cat_id);
if($r !== null){
return $r;
}
}
}
return null;
}
Run Code Online (Sandbox Code Playgroud)
注意:我删除了is_array因为那时$node必须是一个数组或在第一个分支条件下抛出错误.
将您的递归行更改为:
$finded = $this->findnodeintree($node['children'],$cat_id);
Run Code Online (Sandbox Code Playgroud)
你希望能够获得该行,如果你记得这个函数,那行必须填充你的变量,否则它将在最后一次出现的情况下被填充但是永远不会将结果返回给你的第一次调用.
因此,$finded您的第一次通话中将为空或不存在.