php生成无限栏目树_php技巧-tutorial php-php.cn

php生成无限栏目树_php技巧

怪我咯

Lepaskan： 2023-03-13 11:50:02

asal

1252 orang telah melayarinya

本文主要介绍了php生成无限栏目树的相关知识。具有很好的参考价值。下面跟着小编一起来看下吧

栏目数组:

$arr=Array(
  Array(&#39;cid&#39; => 2,&#39;cname&#39; => &#39;新闻&#39;,&#39;pid&#39; => 0),
  Array(&#39;cid&#39; => 4,&#39;cname&#39; =>&#39;体育&#39;,&#39;pid&#39; => 0),
  Array(&#39;cid&#39; => 5,&#39;cname&#39; => &#39;娱乐&#39;,&#39;pid&#39; => 0),
  Array(&#39;cid&#39; => 7,&#39;cname&#39; => &#39;热点新闻&#39;,&#39;pid&#39; =>2),
  Array(&#39;cid&#39; => 8,&#39;cname&#39; => &#39;小众新闻&#39;,&#39;pid&#39; => 2),
  Array(&#39;cid&#39; => 9,&#39;cname&#39; => &#39;民谣新闻&#39;,&#39;pid&#39; => 8),
);

Salin selepas log masuk

'pid','id'=>'id','children'=>'children')){
    $arr = array();
    foreach ($array as &$v) {
      if ($v[$field['pid']] == $pid) {
        $v['level'] = $level;
        $tem = formatTree($array, $v[$field['id']],$v['level']+1,$field);
        //判断是否存在子数组
        $tem && $v[$field['children']] = $tem;
        $arr[] = $v;
      }
    }
    return $arr;
  }
$tree = formatTree( $arr,0,1, $field = array('pid'=>'pid','id'=>'cid','children'=>'children') );
echo '';
print_r( $tree); 
?>　
Salin selepas log masuk

以下主要介绍了PHP超牛逼无限极分类生成树方法,巧用PHP中的引用实现树的生成方法,比递归方法高端多了,需要的朋友可以参考下

function generateTree($items){
    $tree = array();
    foreach($items as $item){
        if(isset($items[$item[&#39;pid&#39;]])){
            $items[$item[&#39;pid&#39;]][&#39;son&#39;][] = &$items[$item[&#39;id&#39;]];
        }else{
            $tree[] = &$items[$item[&#39;id&#39;]];
        }
    }
    return $tree;
}
$items = array(
    1 => array(&#39;id&#39; => 1, &#39;pid&#39; => 0, &#39;name&#39; => &#39;安徽省&#39;),
    2 => array(&#39;id&#39; => 2, &#39;pid&#39; => 0, &#39;name&#39; => &#39;浙江省&#39;),
    3 => array(&#39;id&#39; => 3, &#39;pid&#39; => 1, &#39;name&#39; => &#39;合肥市&#39;),
    4 => array(&#39;id&#39; => 4, &#39;pid&#39; => 3, &#39;name&#39; => &#39;长丰县&#39;),
    5 => array(&#39;id&#39; => 5, &#39;pid&#39; => 1, &#39;name&#39; => &#39;安庆市&#39;),
);
print_r(generateTree($items));

Salin selepas log masuk

可以看到下面打印的结果：

Array
(
    [0] => Array
        (
            [id] => 1
            [pid] => 0
            [name] => 安徽省
            [son] => Array
                (
                    [0] => Array
                        (
                            [id] => 3
                            [pid] => 1
                            [name] => 合肥市
                            [son] => Array
                                (
                                    [0] => Array
                                        (
                                            [id] => 4
                                            [pid] => 3
                                            [name] => 长丰县
                                        )
 
                                )
 
                        )
 
                    [1] => Array
                        (
                            [id] => 5
                            [pid] => 1
                            [name] => 安庆市
                        )
 
                )
 
        )
 
    [1] => Array
        (
            [id] => 2
            [pid] => 0
            [name] => 浙江省
        )
 
)

Salin selepas log masuk

上面生成树方法还可以精简到5行：

function generateTree($items){
    foreach($items as $item)
        $items[$item[&#39;pid&#39;]][&#39;son&#39;][$item[&#39;id&#39;]] = &$items[$item[&#39;id&#39;]];
    return isset($items[0][&#39;son&#39;]) ? $items[0][&#39;son&#39;] : array();
}

Salin selepas log masuk

上面这种无限极分类数据树形结构化的方法值得借鉴。但是我觉得这段代码实际用途并不明显啊，你想取出格式化的树形数据还是要递归啊：

/**
 * 如何取数据格式化的树形数据
 */
$tree = generateTree($items);
function getTreeData($tree){
    foreach($tree as $t){
        echo $t[&#39;name&#39;].&#39;<br>&#39;;
        if(isset($t[&#39;son&#39;])){
            getTreeData($t[&#39;son&#39;]);
        }
    }
}
getTreeData($tree);

Salin selepas log masuk

Atas ialah kandungan terperinci php生成无限栏目树_php技巧. Untuk maklumat lanjut, sila ikut artikel berkaitan lain di laman web China PHP!