PHP無限極分類之數組_PHP教程

來源:互聯網
上載者:User

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...

  • 聯繫我們

    該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

    如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

    A Free Trial That Lets You Build Big!

    Start building with 50+ products and up to 12 months usage for Elastic Compute Service

    • Sales Support

      1 on 1 presale consultation

    • After-Sales Support

      24/7 Technical Support 6 Free Tickets per Quarter Faster Response

    • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.