扁平数据根据parentID构建树形结构

扁平数据根据parentID构建树形结构

package com.example.duohoob.test;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

import com.alibaba.fastjson.JSON;

/**
 * @Title: TreeList.java
 * @Package com.example.duohoob.test
 *
 * @author yangwei
 * @date 2021年10月23日
 */
public class TreeList {

	public static void main(String[] args) {
		
		// 模拟数据
		List<Map<String, Object>> maps = new ArrayList<Map<String,Object>>();
		Map<String, Object> m1 = new HashMap<String, Object>();
		m1.put("id", 1);
		m1.put("name", "a");
		m1.put("parentId", null);
		maps.add(m1);
		Map<String, Object> m2 = new HashMap<String, Object>();
		m2.put("id", 2);
		m2.put("name", "b");
		m2.put("parentId", 1);
		maps.add(m2);
		Map<String, Object> m3 = new HashMap<String, Object>();
		m3.put("id", 3);
		m3.put("name", "c");
		m3.put("parentId", null);
		maps.add(m3);
		Map<String, Object> m4 = new HashMap<String, Object>();
		m4.put("id", 4);
		m4.put("name", "d");
		m4.put("parentId", 3);
		maps.add(m4);
		Map<String, Object> m5 = new HashMap<String, Object>();
		m5.put("id", 5);
		m5.put("name", "e");
		m5.put("parentId", 4);
		maps.add(m5);
		System.out.println(JSON.toJSONString(maps));
		
		List<Integer> idList = new ArrayList<Integer>(maps.size());
		List<Map<String, Object>> roots = new ArrayList<Map<String,Object>>(); // 根节点
		Map<Integer, List<Map<String, Object>>> children = new HashMap<Integer, List<Map<String,Object>>>(); // 所有下级节点
		for (Map<String, Object> map : maps) {
			idList.add((Integer) map.get("id"));
		}
		for (Map<String, Object> map : maps) {
			Integer parentId = (Integer) map.get("parentId");
			if (idList.contains(parentId)) {
				children.computeIfAbsent(parentId, key -> new ArrayList<Map<String, Object>>()).add(map);
				
				// 作用相当于
				/*List<Map<String, Object>> list = children.get(parentId);
				if (null == list) {
					list = new ArrayList<Map<String, Object>>();
					children.put(parentId, list);
				}
				list.add(map);*/
			} else {
				roots.add(map);
			}
		}
		
		// 构建树形结构
		setChildList(roots, children);
		System.out.println(JSON.toJSONString(roots));
		
	}

	private static void setChildList(List<Map<String, Object>> roots, Map<Integer, List<Map<String, Object>>> children) {
		// TODO Auto-generated method stub
		for (Map<String, Object> parent : roots) {
			List<Map<String, Object>> childList = children.get((Integer) parent.get("id"));
			if (null != childList && childList.size() > 0) {
				parent.put("childList", childList);
				
				// 递归
				setChildList(childList, children);
			}
		}
	}
	
}

[
    {
        "name":"a",
        "childList":[
            {
                "name":"b",
                "id":2,
                "parentId":1
            }
        ],
        "id":1
    },
    {
        "name":"c",
        "childList":[
            {
                "name":"d",
                "childList":[
                    {
                        "name":"e",
                        "id":5,
                        "parentId":4
                    }
                ],
                "id":4,
                "parentId":3
            }
        ],
        "id":3
    }
]

  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值