首页 > 编程知识 正文

数据结构二叉树遍历,遍历结构

时间:2023-05-06 00:24:47 阅读:241169 作者:4128

需要把(MenuInfo)换成你的对象

public static List<MenuInfo> getVolists(List<MenuInfo> menuInfoList){ //存放 查询后的数据 List<MenuInfo> dirlistPen = new ArrayList<>(); //判断集合是否为空 if(menuInfoList.size() > 0) { //For循环集合 for (int i = 0; i < menuInfoList.size(); i++) { MenuInfo info = menuInfoList.get(i); //取第一层的数据 if (info.getmPid() == 0) { //把子节点存入Chilaren info.setChildren(getListmenuInfo(info.getmId(),menuInfoList)); dirlistPen.add(info); } } } return dirlistPen; } /** * 遍历子节点 * id 父id * menuInfoList 集合 */ public static List<MenuInfo> getListmenuInfo(int id,List<MenuInfo> menuInfoList){ List<MenuInfo> listvo = new ArrayList<>(); for (int i = 0 ; i < menuInfoList.size() ; i++){ MenuInfo menuInfo = menuInfoList.get(i); if (menuInfo.getmPid() == id){ MenuInfo info = new MenuInfo(); info.setmId(menuInfo.getmId()); info.setmName(menuInfo.getmName()); info.setmPid(menuInfo.getmPid()); info.setmUrl(menuInfo.getmUrl()); info.setmClasses(menuInfo.getmClasses()); info.setmSort(menuInfo.getmSort()); info.setmStartup(menuInfo.getmStartup()); listvo.add(info); } } return listvo; }

版权声明:该文观点仅代表作者本人。处理文章:请发送邮件至 三1五14八八95#扣扣.com 举报,一经查实,本站将立刻删除。