PHP不使用递归的无限级分类简单实例

<"htmlcode">

function resolve2(& $list, $pid = 0) {
  $manages = array();
  foreach ($list as $row) {
    if ($row['pid'] == $pid) {
      $manages[$row['id']] = $row;
      $children = resolve2($list, $row['id']);
      $children && $manages[$row['id']]['children'] = $children;
    }
  }
  return $manages;
}



以上这篇PHP不使用递归的无限级分类简单实例就是小编分享给大家的全部内容了，希望能给大家一个参考，也希望大家多多支持。