PHP:将list列表转为tree树形数据
【摘要】 采用递归将数据列表转换成树
$list = [ ["id" => 1, "name" => "头条", "parent_id" => 0], ["id" => 2, "name" => "快讯", "parent_id" => 0], ["id" => 3, "name" => "情感", "parent_id" =&g...
采用递归将数据列表转换成树
$list = [ ["id" => 1, "name" => "头条", "parent_id" => 0], ["id" => 2, "name" => "快讯", "parent_id" => 0], ["id" => 3, "name" => "情感", "parent_id" => 2], ["id" => 4, "name" => "成人", "parent_id" => 3]
];
- 1
- 2
- 3
- 4
- 5
- 6
/**
* 采用递归将数据列表转换成树
*
* @param $dataArr 数据列表
* @param int $rootId 根节点ID
* @param string $pkName 主键名
* @param string $pIdName 父节点id名
* @param string $childName 子节点名称
* @return array
*/
function ListToTreeRecursive($dataArr, $rootId = 0, $pkName = 'id', $pIdName = 'parent_id', $childName = 'children')
{ $arr = []; foreach ($dataArr as $sorData) { if ($sorData[$pIdName] == $rootId) { $children = ListToTreeRecursive($dataArr, $sorData[$pkName]); if($children){ $sorData[$childName] = $children; } $arr[] = $sorData; } } return $arr;
}
$tree = ListToTreeRecursive($list);
echo json_encode($tree, JSON_UNESCAPED_UNICODE);
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
[ { "id":1, "name":"头条", "parent_id":0 }, { "id":2, "name":"快讯", "parent_id":0, "children":[ { "id":3, "name":"情感", "parent_id":2, "children":[ { "id":4, "name":"成人", "parent_id":3 } ] } ] }
]
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
文章来源: pengshiyu.blog.csdn.net,作者:彭世瑜,版权归原作者所有,如需转载,请联系作者。
原文链接:pengshiyu.blog.csdn.net/article/details/117511179
【版权声明】本文为华为云社区用户转载文章,如果您发现本社区中有涉嫌抄袭的内容,欢迎发送邮件进行举报,并提供相关证据,一经查实,本社区将立刻删除涉嫌侵权内容,举报邮箱:
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论(0)