Runtime 79 ms Beats 97.77%

topKFrequent.ts

function topKFrequent(nums: number[], k: number): number[] {
    let map = new Map<number, number>();
    for (const num of nums) {
        if (map.has(num)) {
            map.set(num, map.get(num) + 1);
        }
        else {
            map.set(num, 1);
        }
    }

    return [...map.keys()].sort((a: number, b: number) => {
        a = map.get(a);
        b = map.get(b);
        return a > b ? -1 : b < a ? 1 : 0;
    }).slice(0, k);
};