[LeetCode] 347. Top K Frequent elements (javascript)

 

 

/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number[]}
 */
var topKFrequent = function(nums, k) {
    const map=new Map();
    for(const num of nums){
        if(!map.has(num)){
            map.set(num,1)
        }else{
            map.set(num,map.get(num)+1);
        }
    }
    const arr=[];
    for(const [key,value] of map){
        arr.push([key,value]);
    }
    arr.sort((a,b)=>b[1]-a[1]);
    const answer=[];
    for(let i=0;i<k;i++){
        answer.push(arr[i][0]);
    }
    
    return answer;
};