PHP无限极分类之数组
array('id' => 1,'name' => 'name1','pid' => 0),
2 => array('id' => 2,'name' => 'name2','pid' => 0),
3 => array('id' => 3,'name' => 'name3','pid' => 1),
4 => array('id' => 4,'name' => 'name4','pid' => 0),
5 => array('id' => 5,'name' => 'name5','pid' => 3),
6 => array('id' => 6,'name' => 'name6','pid' => 3),
);
$str = getTree(0);
$str = "" . $str . "";
echo $str;
function getTree($id,$spac=0)
{
$data = array( 1 => array('id' => 1,'name' => 'name1','pid' => 0),
2 => array('id' => 2,'name' => 'name2','pid' => 0),
3 => array('id' => 3,'name' => 'name3','pid' => 1),
4 => array('id' => 4,'name' => 'name4','pid' => 0),
5 => array('id' => 5,'name' => 'name5','pid' => 3),
6 => array('id' => 6,'name' => 'name6','pid' => 3),
);
$spac = $spac + 2;
static $str;
foreach ($data as $k => $v) {
if ($v['pid'] == $id) {
$arr[] = $v;
$str .= "" . str_repeat(" ",$spac) . "|--" . $v['name'] . "";
getTree($v['id'],$spac);
}
}
return $str;
}
?>
http://www.bkjia.com/PHPjc/1079403.htmlwww.bkjia.comtruehttp://www.bkjia.com/PHPjc/1079403.htmlTechArticlePHP无限极分类之数组 ?php$data = array( 1 = array(id = 1,name = name1,pid = 0), 2 = array(id = 2,name = name2,pid = 0), 3 = array(id = 3,name = name3,pid = 1), 4 = array(id...
本条技术文章来源于互联网,如果无意侵犯您的权益请点击此处反馈版权投诉 本文系统来源:php中文网