求算法---无限极分类 本帖最后由 xuzuning 于 2013-11-07 19:15:45 编辑 解决方案 » 免费领取超大流量手机卡,每月29元包185G流量+100分钟通话, 中国电信官方发货 $arr = array( 1=>array('id'=>'1','name'=>'1','pid'=>'0'), 2=>array('id'=>'2','name'=>'2','pid'=>'0'), 3=>array('id'=>'3','name'=>'11','pid'=>'1'), 4=>array('id'=>'4','name'=>'22','pid'=>'2'),);function tree($arr){ $t = array(); foreach($arr as $v){ if (isset($arr[$v['pid']])){ $arr[$v['pid']]['child'][] = &$arr[$v['id']]; }else{ $t[] = &$arr[$v['id']]; } } return $t;}echo '<pre>';print_r(tree($arr)); function find_child($ar, $id='id', $pid='pid') { foreach($ar as $v) $t[$v[$id]] = $v; foreach ($t as $k => $item){ if( $item[$pid] ) { $t[$item[$pid]]['child'][] =&$t[$k]; unset($t[$k]); } } return $t;}$data = array( array('ID'=>1,'PARENT'=>0,'NAME'=>'kobe'), array('ID'=>2,'PARENT'=>0,'NAME'=>'jama'), array('ID'=>3,'PARENT'=>1,'NAME'=>'kobe1'), array('ID'=>4,'PARENT'=>2,'NAME'=>'jama1'), array('ID'=>5,'PARENT'=>0,'NAME'=>'lizhi'), array('ID'=>6,'PARENT'=>1,'NAME'=>'kobe2'),);$c = find_child($data, 'ID', 'PARENT');echo '<pre>';print_r($c);欢迎指正…… <?php/*** 通用的树型类,可以生成任何树型结构*/class Tree{ /** * 生成树型结构所需要的2维数组 * @var array */ var $arr = array(); /** * 生成树型结构所需修饰符号,可以换成图片 * @var array */ var $icon = array('│','├','└'); /** * @access private */ var $ret = ''; /** * 构造函数,初始化类 * @param array 2维数组,例如: * array( * 1 => array('id'=>'1','parentid'=>0,'name'=>'一级栏目一'), * 2 => array('id'=>'2','parentid'=>0,'name'=>'一级栏目二'), * 3 => array('id'=>'3','parentid'=>1,'name'=>'二级栏目一'), * 4 => array('id'=>'4','parentid'=>1,'name'=>'二级栏目二'), * 5 => array('id'=>'5','parentid'=>2,'name'=>'二级栏目三'), * 6 => array('id'=>'6','parentid'=>3,'name'=>'三级栏目一'), * 7 => array('id'=>'7','parentid'=>3,'name'=>'三级栏目二') * ) */ function set_tree($arr=array()) { $this->arr = $arr; $this->ret = ''; return is_array($arr); } /** * 得到父级数组 * @param int * @return array */ function get_parent($myid) { $newarr = array(); if(!isset($this->arr[$myid])) return false; $pid = $this->arr[$myid]['parentid']; return $this->detail($pid); } function detail($id,$key=null){ $r = $this->arr[$id]; return $key ? $r[$key]:$r; } /** * 得到子级数组 * @param int * @return array */ function get_child($myid) { $a = $newarr = array(); if(is_array($this->arr)) { foreach($this->arr as $id => $a) { if($a['parentid'] == $myid) $newarr[$id] = $a; } } return $newarr ? $newarr : false; } /** * 得到子级数组 * @param int * @return array */ function get_childs($myid) { if(!$this->arr) return false; $newarr = array(); foreach($this->arr as $id => $a) { if($a['parentid'] == $myid){ $newarr[$id] = $a; foreach($this->arr as $id => $b) { if($b['parentid'] == $a['parentid']){ $newarr += $this->get_childs($a['id']); } } } } return $newarr; } /** * 得到当前位置数组 * @param int * @return array */ function get_pos($myid) { if(!isset($this->arr[$myid])) return false; $a[$myid] = $this->arr[$myid]; $pid = $this->arr[$myid]['parentid']; if(isset($this->arr[$pid])) { $a += $this->get_pos($pid); } asort($a); return $a; } function get_pos_ids($id){ return implode(',',array_keys($this->get_pos($id))); } /** * ------------------------------------- * 得到树型结构 * ------------------------------------- * @author Midnight(杨云洲), [email protected] * @param $myid 表示获得这个ID下的所有子级 * @param $str 生成树形结构基本代码, 例如: "<option value=\$id \$select>\$spacer\$name</option>" * @param $sid 被选中的ID, 比如在做树形下拉框的时候需要用到 * @param $adds * @param $str_group * @return unknown_type */ function get_tree($myid, $str, $sid = 0, $adds = '', $str_group = '') { $number=1; $child = $this->get_child($myid); if(is_array($child)) { $total = count($child); foreach($child as $id=>$a) { $j=$k=''; if($number==$total) { $j .= $this->icon[2]; } else { $j .= $this->icon[1]; $k = $adds ? $this->icon[0] : ''; } $spacer = $adds ? $adds.$j : ''; $selected = $id==$sid ? 'selected' : ''; @extract($a); $parentid == 0 && $str_group ? eval("\$nstr = \"$str_group\";") : eval("\$nstr = \"$str\";"); $this->ret .= $nstr; $this->get_tree($id, $str, $sid, $adds.$k.' ',$str_group); $number++; } } return $this->ret; } /** * 同上一方法类似,但允许多选 */ function get_tree_multi($myid, $str, $sid = 0, $adds = '') { $number=1; $child = $this->get_child($myid); if(is_array($child)) { $total = count($child); foreach($child as $id=>$a) { $j=$k=''; if($number==$total) { $j .= $this->icon[2]; } else { $j .= $this->icon[1]; $k = $adds ? $this->icon[0] : ''; } $spacer = $adds ? $adds.$j : ''; $selected = $this->have($sid,$id) ? 'selected' : ''; //echo $sid.'=>'.$id.' : '.$selected.' . <br/>'; @extract($a); eval("\$nstr = \"$str\";"); $this->ret .= $nstr; $this->get_tree_multi($id, $str, $sid, $adds.$k.' '); $number++; } } return $this->ret; } function have($list,$item){ return(strpos(',,'.$list.',',','.$item.',')); }} http://blog.csdn.net/i_bruce/article/details/41558063 求添加一个搜索引擎分页。 phpMyAdmin能连接MySQL吗? 虚拟主机需要怎么设置PHP? 求助,发送邮件,如何发送php动态生成的文件的 连接数据库问题--PHP无法连接MYSQL怎么办啊?? php怎样连接MS_SQLSERVER 请教一个哉名与空间的问题。 关于session 帮忙看一下这个错误错在哪里? easyui登陆 使用php写网络爬虫 Apache HTTP服务器?
$arr = array(
1=>array('id'=>'1','name'=>'1','pid'=>'0'),
2=>array('id'=>'2','name'=>'2','pid'=>'0'),
3=>array('id'=>'3','name'=>'11','pid'=>'1'),
4=>array('id'=>'4','name'=>'22','pid'=>'2'),
);
function tree($arr){
$t = array();
foreach($arr as $v){
if (isset($arr[$v['pid']])){
$arr[$v['pid']]['child'][] = &$arr[$v['id']];
}else{
$t[] = &$arr[$v['id']];
}
}
return $t;
}
echo '<pre>';print_r(tree($arr));
function find_child($ar, $id='id', $pid='pid') {
foreach($ar as $v) $t[$v[$id]] = $v;
foreach ($t as $k => $item){
if( $item[$pid] ) {
$t[$item[$pid]]['child'][] =&$t[$k];
unset($t[$k]);
}
}
return $t;
}
$data = array(
array('ID'=>1,'PARENT'=>0,'NAME'=>'kobe'),
array('ID'=>2,'PARENT'=>0,'NAME'=>'jama'),
array('ID'=>3,'PARENT'=>1,'NAME'=>'kobe1'),
array('ID'=>4,'PARENT'=>2,'NAME'=>'jama1'),
array('ID'=>5,'PARENT'=>0,'NAME'=>'lizhi'),
array('ID'=>6,'PARENT'=>1,'NAME'=>'kobe2'),
);$c = find_child($data, 'ID', 'PARENT');
echo '<pre>';
print_r($c);
欢迎指正……
/**
* 通用的树型类,可以生成任何树型结构
*/
class Tree
{
/**
* 生成树型结构所需要的2维数组
* @var array
*/
var $arr = array();
/**
* 生成树型结构所需修饰符号,可以换成图片
* @var array
*/
var $icon = array('│','├','└');
/**
* @access private
*/
var $ret = '';
/**
* 构造函数,初始化类
* @param array 2维数组,例如:
* array(
* 1 => array('id'=>'1','parentid'=>0,'name'=>'一级栏目一'),
* 2 => array('id'=>'2','parentid'=>0,'name'=>'一级栏目二'),
* 3 => array('id'=>'3','parentid'=>1,'name'=>'二级栏目一'),
* 4 => array('id'=>'4','parentid'=>1,'name'=>'二级栏目二'),
* 5 => array('id'=>'5','parentid'=>2,'name'=>'二级栏目三'),
* 6 => array('id'=>'6','parentid'=>3,'name'=>'三级栏目一'),
* 7 => array('id'=>'7','parentid'=>3,'name'=>'三级栏目二')
* )
*/
function set_tree($arr=array())
{
$this->arr = $arr;
$this->ret = '';
return is_array($arr);
}
/**
* 得到父级数组
* @param int
* @return array
*/
function get_parent($myid)
{
$newarr = array();
if(!isset($this->arr[$myid])) return false;
$pid = $this->arr[$myid]['parentid'];
return $this->detail($pid);
}
function detail($id,$key=null){
$r = $this->arr[$id];
return $key ? $r[$key]:$r;
} /**
* 得到子级数组
* @param int
* @return array
*/
function get_child($myid)
{
$a = $newarr = array();
if(is_array($this->arr))
{
foreach($this->arr as $id => $a)
{
if($a['parentid'] == $myid) $newarr[$id] = $a;
}
}
return $newarr ? $newarr : false;
}
/**
* 得到子级数组
* @param int
* @return array
*/
function get_childs($myid)
{
if(!$this->arr) return false;
$newarr = array();
foreach($this->arr as $id => $a)
{
if($a['parentid'] == $myid){
$newarr[$id] = $a;
foreach($this->arr as $id => $b)
{
if($b['parentid'] == $a['parentid']){
$newarr += $this->get_childs($a['id']);
}
}
}
}
return $newarr;
}
/**
* 得到当前位置数组
* @param int
* @return array
*/
function get_pos($myid)
{
if(!isset($this->arr[$myid])) return false; $a[$myid] = $this->arr[$myid];
$pid = $this->arr[$myid]['parentid'];
if(isset($this->arr[$pid]))
{
$a += $this->get_pos($pid);
}
asort($a);
return $a;
}
function get_pos_ids($id){
return implode(',',array_keys($this->get_pos($id)));
}
/**
* -------------------------------------
* 得到树型结构
* -------------------------------------
* @author Midnight(杨云洲), [email protected]
* @param $myid 表示获得这个ID下的所有子级
* @param $str 生成树形结构基本代码, 例如: "<option value=\$id \$select>\$spacer\$name</option>"
* @param $sid 被选中的ID, 比如在做树形下拉框的时候需要用到
* @param $adds
* @param $str_group
* @return unknown_type
*/
function get_tree($myid, $str, $sid = 0, $adds = '', $str_group = '')
{
$number=1;
$child = $this->get_child($myid);
if(is_array($child))
{
$total = count($child);
foreach($child as $id=>$a)
{
$j=$k='';
if($number==$total)
{
$j .= $this->icon[2];
}
else
{
$j .= $this->icon[1];
$k = $adds ? $this->icon[0] : '';
}
$spacer = $adds ? $adds.$j : '';
$selected = $id==$sid ? 'selected' : '';
@extract($a);
$parentid == 0 && $str_group ? eval("\$nstr = \"$str_group\";") : eval("\$nstr = \"$str\";");
$this->ret .= $nstr;
$this->get_tree($id, $str, $sid, $adds.$k.' ',$str_group);
$number++;
}
}
return $this->ret;
} /**
* 同上一方法类似,但允许多选
*/
function get_tree_multi($myid, $str, $sid = 0, $adds = '')
{
$number=1;
$child = $this->get_child($myid);
if(is_array($child))
{
$total = count($child);
foreach($child as $id=>$a)
{
$j=$k='';
if($number==$total)
{
$j .= $this->icon[2];
}
else
{
$j .= $this->icon[1];
$k = $adds ? $this->icon[0] : '';
}
$spacer = $adds ? $adds.$j : '';
$selected = $this->have($sid,$id) ? 'selected' : '';
//echo $sid.'=>'.$id.' : '.$selected.' . <br/>';
@extract($a);
eval("\$nstr = \"$str\";");
$this->ret .= $nstr;
$this->get_tree_multi($id, $str, $sid, $adds.$k.' ');
$number++;
}
}
return $this->ret;
}
function have($list,$item){
return(strpos(',,'.$list.',',','.$item.','));
}
}