php 无限递归分类

$categories = array(  
    array('id'=>1,'name'=>'电脑','pid'=>0),  
    array('id'=>2,'name'=>'手机','pid'=>0),  
    array('id'=>3,'name'=>'笔记本','pid'=>1),  
    array('id'=>4,'name'=>'台式机','pid'=>1),  
    array('id'=>5,'name'=>'智能机','pid'=>2),  
    array('id'=>6,'name'=>'功能机','pid'=>2),  
    array('id'=>7,'name'=>'超级本','pid'=>3),  
    array('id'=>8,'name'=>'游戏本','pid'=>3),  
    array('id'=>9,'name'=>'安卓','pid'=>5),  
    array('id'=>10,'name'=>'ios','pid'=>5),  
);  
  
function my_category($categories, $pid=0){
	$tree = array();
	foreach($categories as $key=>$value){
		if($value['pid'] == $pid){
			$value['children'] = my_category($categories, $value['id']);
			if($value['children'] == null){
				unset($value['children']);
			}
			$tree[] = $value;
		}
	}
	return $tree;
}

$tree = my_category($categories, 0);
echo '<pre>';print_r($tree);exit;

猜你喜欢

转载自blog.csdn.net/wmsjlihuan/article/details/78332258
今日推荐