zoukankan      html  css  js  c++  java
  • 无限极分类(二)显示分类级别

    数据表结构:

    函数:

    function tree($arr, $pid = 0, $level = 1){
      static $arr2 = [];
      foreach($arr as $v){
        if($v['parent_id'] == $pid){
          $v['level'] = $level;
          $arr2[] = $v;
          tree($arr, $v['cat_id'], $level+1);
        }
      }
      return $arr2;
    }

    tree($list);

    结果:

    array(19) {
      [0] => array(6) {
        ["cat_id"] => string(1) "1"
        ["cat_name"] => string(6) "女装"
        ["parent_id"] => string(1) "0"
        ["sort_order"] => string(2) "50"
        ["is_show"] => string(1) "1"
        ["level"] => int(1)
      }
      [1] => array(6) {
        ["cat_id"] => string(1) "6"
        ["cat_name"] => string(9) "连衣裙"
        ["parent_id"] => string(1) "1"
        ["sort_order"] => string(2) "50"
        ["is_show"] => string(1) "1"
        ["level"] => int(2)
      }
      [2] => array(6) {
        ["cat_id"] => string(2) "31"
        ["cat_name"] => string(12) "我的最爱"
        ["parent_id"] => string(1) "6"
        ["sort_order"] => string(2) "50"
        ["is_show"] => string(1) "1"
        ["level"] => int(3)
      }

    ....
  • 相关阅读:
    cpuset
    top
    path-lookup
    strace
    IDR算法[原理]
    cgroup
    转载
    std::reverse_iterator::base
    可重入、不可重入
    chromium code 中 普遍使用的 C++11 语法
  • 原文地址:https://www.cnblogs.com/catcrazy/p/6242579.html
Copyright © 2011-2022 走看看