문제확인
https://programmers.co.kr/learn/courses/30/lessons/42889
문제풀이
function solution(N, stages) {
var answer = [];
let rate = 0;
for (let i = 1; i <= N; i++) {
let challenger = stages.filter(el => i <= el).length;
let failer = stages.filter(el => i === el).length;
if(challenger === 0 || failer === 0) rate = 0;
else rate = failer / challenger;
answer.push({stage : i, rate : rate});
answer.sort((a, b) => {
if (b.rate === a.rate) {
return a.rate - b.rate;
} else {
return b.rate - a.rate;
}
});
}
return answer.map((el) => el.stage);
}