优化递归子节点

This commit is contained in:
RuoYi
2020-08-28 10:25:31 +08:00
parent 2e6f5b2890
commit d20acb78e1

View File

@@ -50,13 +50,7 @@ public class TreeUtils
{
if (hasChild(list, tChild))
{
// 判断是否有子节点
Iterator<Menu> it = childList.iterator();
while (it.hasNext())
{
Menu n = (Menu) it.next();
recursionFn(list, n);
}
recursionFn(list, tChild);
}
}
}