Linjiayu6 / LeetCode

[2019+] CS Fundamentals: Algorithms and Data structures
0 stars 0 forks source link

[堆] #14

Open Linjiayu6 opened 4 years ago

Linjiayu6 commented 4 years ago

1 - 347. 前 K 个高频元素

var topKFrequent = function(nums, k) {
    if (nums.length < 1 || nums.length < k) return []
    var map = new Map()
    for (_d of nums) {
        map.has(_d) ? map.set(_d, map.get(_d) + 1) : map.set(_d, 1)
    }

    var nums = [...new Set(nums)]
    // 根据map里的数量, 来从大到小排序
    return nums.sort((a, b) => map.get(b) - map.get(a)).slice(0, k)
};