java 实现递归实现tree

package com.bert.logic;


import java.util.ArrayList;
import java.util.List;


import com.alibaba.fastjson.JSON;


public class Menu {
private Integer pid;
private String menuName;
private Integer parentId;
private Integer position;
private List<Menu> childMenu;


public Integer getPid() {
return pid;
}




public void setPid(Integer pid) {
this.pid = pid;
}




public String getMenuName() {
return menuName;
}




public void setMenuName(String menuName) {
this.menuName = menuName;
}




public Integer getParentId() {
return parentId;
}




public void setParentId(Integer parentId) {
this.parentId = parentId;
}




public Integer getPosition() {
return position;
}




public void setPosition(Integer position) {
this.position = position;
}




public List<Menu> getChildMenu() {
return childMenu;
}




public void setChildMenu(List<Menu> childMenu) {
this.childMenu = childMenu;
}



public Menu(Integer pid, String menuName, Integer parentId, Integer position) {
super();
this.pid = pid;
this.menuName = menuName;
this.parentId = parentId;
this.position = position;
}



public Menu() {
super();
}




public static void main(String[] args) {
List<Menu> treeMenu=new ArrayList<Menu>();

List<Menu> list=new ArrayList<Menu>();
Menu menu1=new Menu(1, "父级1", 0, 1);
Menu menu2=new Menu(2, "父级2", 0, 2);
Menu menu1_1=new Menu(3, "子级1_1", 1, 1);
Menu menu1_2=new Menu(4, "子级1_2", 1, 2);
Menu menu1_2_1=new Menu(5, "子级1_2_1", 4, 2);
list.add(menu1);
list.add(menu2);
list.add(menu1_1);
list.add(menu1_2);
list.add(menu1_2_1);

List<Menu> listTree=buildTree(list,0);

String trssJson=JSON.toJSONString(listTree);
System.out.println(trssJson);

}

public static List<Menu> buildTree(List<Menu> list,int parentId){
List<Menu> menus=new ArrayList<Menu>();
      for (Menu menu : list) {  
  
          int menuId = menu.getPid();
          int pid = menu.getParentId();
          if (parentId == pid) {  
              List<Menu> menuLists = buildTree(list, menuId);  
              
              menu.setChildMenu(menuLists);
              menus.add(menu);  
          }  
      }  
     
return menus;
}
}
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值