Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[堆] #14

Open
Linjiayu6 opened this issue Jul 26, 2020 · 0 comments
Open

[堆] #14

Linjiayu6 opened this issue Jul 26, 2020 · 0 comments

Comments

@Linjiayu6
Copy link
Owner

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)
};
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant