PHP遞迴重新排序無限級分類數組

來源:互聯網
上載者:User

標籤:return   name   php   遞迴   ati   find   each   for   mod   

public static  function Menus($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),
);*/
$menu = Menu::model()->findAll();

$arr = array();
// $arr = array_push($arr,$arr);
foreach ($menu as $k => $v) {
if ($v[‘parent_id‘] == $id) {
// $arr[] = $v;
//$v[‘id‘] =str_repeat(‘ ‘,$spac) .$v[‘name‘];
// $str .= "<option value=‘" . $v[‘id‘] . "‘>" . str_repeat("&nbsp;",$spac) . "|--" . $v[‘name‘] . "</option>";
// self::Menus($v[‘id‘],$spac);
$arr[] = $v;
$arr = array_merge($arr,self::Menus($v[‘menu_id‘])); //遞迴合并數組

}

}
// print_r($arrs);
return $arr;
}

PHP遞迴重新排序無限級分類數組

相關文章

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在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.