根据树状结构划分层级
在 php 中，我们可以使用递归来实现根据树状结构划分层级：
假定输入 $tree 数组如下：
[ {"id":1,"name":"人事","pid":0,"level":0,"son":[{"id":3,"name":"招聘部","pid":1,"level":1,"son":[{"id":7,"name":"研发部","pid":3,"level":2,"son":[]},{"id":8,"name":"行政部","pid":3,"level":2,"son":[]}]},{"id":4,"name":"人事部","pid":1,"level":1,"son":[]}]}, {"id":2,"name":"技术部","pid":0,"level":0,"son":[{"id":5,"name":"研发部","pid":2,"level":1,"son":[]},{"id":6,"name":"运维部","pid":2,"level":1,"son":[]}]}]
递归函数：
立即学习“PHP免费学习笔记（深入）”；
function groupbylevel($tree) { $result = []; foreach ($tree as $node) { $result[$node['level']][] = $node; if (!empty($node['son'])) { $result = array_merge($result, groupbylevel($node['son'])); } } return $result;}
执行该函数：
$result = groupbylevel($tree);
输出结果：
[ 0 => [ {"id":1,"name":"人事","pid":0,"level":0,"son":[...]}, {"id":2,"name":"技术部","pid":0,"level":0,"son":[...]}, ], 1 => [ {"id":3,"name":"招聘部","pid":1,"level":1,"son":[...]}, {"id":4,"name":"人事部","pid":1,"level":1,"son":[...]}, {"id":5,"name":"研发部","pid":2,"level":1,"son":[...]}, {"id":6,"name":"运维部","pid":2,"level":1,"son":[...]}, ], 2 => [ {"id":7,"name":"研发部","pid":3,"level":2,"son":[]}, {"id":8,"name":"行政部","pid":3,"level":2,"son":[]}, ],]
以上就是如何用PHP递归函数根据树状结构划分层级？的详细内容，更多请关注创想鸟其它相关文章！
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。
如发现本站有涉嫌抄袭侵权/违法违规的内容， 请发送邮件至 chuangxiangniao@163.com 举报，一经查实，本站将立刻删除。
发布者：程序猿，转转请注明出处：https://www.chuangxiangniao.com/p/1283155.html
微信扫一扫 
支付宝扫一扫 
