java递归查询全部的子节点,子节点下也有子节点额

    //装子节点集合
    static  List<TbUserDepartmentDic> childMenu=new ArrayList<TbUserDepartmentDic>();
    /**
        menuList 全部的集合
        pid 父级id
    */
    public static List<TbUserDepartmentDic> treeMenuList( List<TbUserDepartmentDic> menuList, long pid){
        for(TbUserDepartmentDic mu: menuList){
            //遍历出父id等于参数的id,add进子节点集合
            if(mu.getParentDepartmentId()==pid){
                //递归遍历下一级
                treeMenuList(menuList,mu.getDepartmentId());
                childMenu.add(mu);
            }
        }
        return childMenu;
    }

猜你喜欢

转载自blog.csdn.net/qq_38567039/article/details/88657928
今日推荐