nums = [1,1,1,2,2,3],
k = 2
return [1,2]
nums = [1]
k = 1
return [1]
function topK(nums, k) {
let obj = {};
let arr = [];
nums.forEach(el => {
if (obj[el]) {
obj[el]++;
} else {
obj[el] = 1;
}
});
for (let properyName in obj) {
arr.push([properyName, obj[properyName]]);
}
return arr.sort((a, b) => (b[1] - a[1])).slice(0,k).map(el => Number(el[0]));
}