function solution(id_list, reportList, k) {
let reports = [...new Set(reportList)].map((a) => {
return a.split(" ");
});
const bad = {};
for (let report of reports) {
bad[report[1]] = bad[report[1]] + 1 || 1;
}
const good = {};
for (let report of reports) {
if (bad[report[1]] >= k) {
good[report[0]] = good[report[0]] + 1 || 1;
}
}
const res = id_list.map((id) => good[id] || 0);
return res;
}
javascript 로 알고리즘 풀 생각은 못했었는데, 종종 풀어봐야겠다
배운 점