java递归树实现
导读:public static List<SysDict> buildTree(List<SysDict> list, String pid { List<SysDict> treeList = ne...
public static ListSysDict>
buildTree(ListSysDict>
list, String pid){
ListSysDict>
treeList = new LinkedList>
();
for (SysDict sysDict : list) {
if (sysDict.getParentId().equals(pid)) {
sysDict.setChild(buildTree(list, sysDict.getId()));
treeList.add(sysDict);
}
}
return treeList;
}
声明:本文内容由网友自发贡献,本站不承担相应法律责任。对本内容有异议或投诉,请联系2913721942#qq.com核实处理,我们将尽快回复您,谢谢合作!
若转载请注明出处: java递归树实现
本文地址: https://pptw.com/jishu/506313.html