✅406. 根据身高重建队列 about like-algorithms HOT 1 OPEN

/**
 * @param {number[][]} people
 * @return {number[][]}
 */
var reconstructQueue = function(people) {
    // 进行 h升序 k降序
    people.sort((a, b) => {
        if (a[0] == b[0]) {
            return b[1] - a[1];
        }
        return a[0] - b[0];
    });

    // 创建长度为 people.length 的长度的 index 集合
    const indexList = Array(people.length).fill().map((_, index) => index);
    const dict = {};
    for (let i = 0; i < people.length; i++) {
        const item = people[i];
        const index = indexList.splice(item[1], 1)[0];
        dict[index] = item;
    }
    return Object.values(dict);
};