js 数组扁平结构转树tree结构

待处理数据

var treeList = [
	{
		title: "一级1——二级1",
		parentName: "一级1",
		parentId: 1,
		id: 11,
	},
	{
		title: "一级1——二级1——三级1",
		parentName: "一级1——二级1",
		parentId: 11,
		id: 111,
	},
	{
		title: "一级1——二级1——三级2",
		parentName: "一级1——二级1",
		parentId: 11,
		id: 112,
	},
	{
		title: "一级1——二级1——三级3",
		parentName: "一级1——二级1",
		parentId: 11,
		id: 113,
	},
	{
		title: "一级1——二级2",
		parentName: "一级1",
		parentId: 1,
		id: 22,
	},
	{
		title: "一级1——二级2——三级1",
		parentName: "一级1——二级2",
		parentId: 22,
		id: 221,
	},
	{
		title: "一级1",
		parentName: "",
		parentId: 0,
		id: 1,
	},
	{
		title: "一级1——二级2——三级2",
		parentName: "一级1——二级2",
		parentId: 22,
		id: 222,
	},
	{
		title: "一级1——二级2——三级3",
		parentName: "一级1——二级2",
		parentId: 22,
		id: 223,
	},
	{
		title: "一级2——二级1",
		parentName: "一级2",
		parentId: 33,
		id: 331,
	},
	{
		title: "一级2——二级2",
		parentName: "一级2",
		parentId: 33,
		id: 332,
	},
	{
		title: "一级2——二级3",
		parentName: "一级2",
		parentId: 33,
		id: 333,
	},
	{
		title: "一级2",
		parentName: "",
		id: 33,
	},
];

处理后数据

第一种，对象下标唯一性

function getTree(data = [], idKey = "id", pidKey = "parentId", childrenKey = "children") {
	if (!Array.isArray(data)) return [];
	let arr = JSON.parse(JSON.stringify(data));
	let obj = {},
		treeArr = [];
	arr.forEach((item) => {
		// item[childrenKey] = []; // 给每个item添加children属性并赋值空数组，最后一级会存在children
		delete item[childrenKey];
		obj[item[idKey]] = item;
	});
	arr.forEach((item) => {
		let objItem = obj[item[pidKey]];
		if (objItem) {
			(obj[item[pidKey]][childrenKey] || (obj[item[pidKey]][childrenKey] = [])).push(item);
		} else {
			treeArr.push(item);
		}
	});
	console.log(treeArr);
	return treeArr;
}
getTree(treeList);

第二种，两层filter（第一层的filter的判断条件有问题，目前只适合数据第一级的parentId为假值）

function getData(array = [], idKey = "id", pidKey = "parentId", childrenKey = "children") {
	if (!Array.isArray(array)) return [];
	let arr = JSON.parse(JSON.stringify(array));
	let data = arr.filter((item) => {
		let children = arr.filter((e) => item[idKey] === e[pidKey]);
		// item[childrenKey] = children;  // 最后一级会存在空数组children
		if (children.length) item[childrenKey] = children; // 去掉最后一级的children
		return !item[pidKey];
	});
	console.log(data);
	return data;
}
getData(treeList);