16. 又是一道的数组转树面试题

[KRISACHAN]

RT.

[KRISACHAN]

'use strict'
const list = [
    {
        id: 1,
        name: 'dad'
    },
    {
        id: 3,
        name: 'ttt'
    },
    {
        id: 2,
        name: 'gg'
    },
    {
        id: 5,
        name: 'll'
    }
]
const hash = []
for (let i = 0, len = list.length; i < len; ++i) {
    hash[list[i].id] = {
        id: list[i].id,
        name: list[i].name
    }
}
const result = hash.reduceRight((prev, cur) => ({
    ...cur,
    child: {
        ...prev
    }
}))

[shengq666]

除了666我还能说什么呢。。。想不到比你写的好的了。@鱼头