day3은 못풀었다ㅠ
nums = [1,1,1,2,2,3]
k = 2
return [1,2]
nums = [1]
k = 1
return [1]
💡 My Solution
function topK(nums, k) {
let a = [];
let result = [];
nums.map(x => { a[x] = 0 }); //
nums.map(x => { a[x]++ });
let save = [...a];
a.sort(function(a, b){ return b - a; });
for(let i = 0; i < k; i++) {
result.push(save.indexOf(a[i]));
}
return result;
}