PHP-递归函数foreach [英] PHP - recursive function foreach

问题描述

我将创建一个递归函数，以便从数组中检索数据并进行组织.但是，我在建立正确的逻辑上有些困难.该原理必须适用于任何子级别，直到其结束或什么都没有找到为止.我想通过在foreach中重复一个foreach来防止这种代码...

I would to create a recursive function in order to retrieve data from an array and to organize then. However I have some difficulties to create the right logic. The principle must be apply to any sub level until it ends or nothing is found. I want to prevent this kind of code by repeating a foreach inside a foreach...:

$cats = get_categories($args);  
$categories = array();
foreach($cats as $cat){
    $parent = $cat->category_parent;
    if ($parent) {
            $categories['child'][$parent][$cat->cat_ID] = $cat->name;
        } else {
            $categories['parent'][$cat->cat_ID] = $cat->name;
        }
    }
}

if (isset($categories['parent']) && !empty($categories['parent'])) {
        foreach($categories['parent'] as $id => $cat){

            $new_cats[$id]['title'] = $cat;

            if (isset($categories['child'][$id])) {
                foreach($categories['child'][$id] as $child_id => $child_cat){

                    $new_cats[$child_id]['title'] = $child_cat;
                    $new_cats[$child_id]['parent_id'] = $id;

                    if (isset($categories['child'][$child_id])) {
                        foreach($categories['child'][$child_id] as $sub_child_id => $sub_child_cat){

                            $new_cats[$sub_child_id]['title'] = $sub_child_cat;
                            $new_cats[$sub_child_id]['parent_id'] = $child_id;

                        }
                    }

                }
            }
        }

    }
}

推荐答案

也许是这段代码可以帮助您了解格式化所需数组格式的想法.

May be this code help you to get idea for formatting your desired array format.

<?php
// Main function
function BuildArr($arr)
{
    $formattedArr = array();
    if(!empty($arr))
    {
        foreach($arr as $val)
        {
            if($val['has_children'])
            {
                $returnArr = SubBuildArr($val['children']);  // call recursive function
                if(!empty($rs))
                {
                    $formattedArr[] = $returnArr;
                }
            }
            else
            {
                $formattedArr[] = $val;         
            }
        }
    }
    return $formattedArr;
}

// Recursive Function( Build child )
function SubBuildArr($arr)
{
    $sub_fortmattedArr = array();
    if(!empty($arr))
    {
        foreach($arr as $val)
        {
            if($val['has_children'])
            {
                $response = SubBuildArr($val['children']); // call recursive
                if(!empty($response))
                {
                    $sub_fortmattedArr[] = $response;
                }
            }
            else
            {
                $sub_fortmattedArr[] = $arr;
            }
        }
        return  $sub_fortmattedArr;
    }
}
?>

我在以前的项目中使用此代码来生成最高第n级的类别

I use this code for my previous project for generating categories that upto n-th level

这篇关于PHP-递归函数foreach的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！