Week 3 - 1 - 명예의 전당 (1)

[yoorli]

문제 링크: https://school.programmers.co.kr/learn/courses/30/lessons/138477

[mjpark-k]

function solution(k, score) {
    const hallOfFame = [];
    const answer = [];
    
    for (let i = 0; i < score.length; i++) {
        if (i < k) {
            hallOfFame.push(score[i]);
            hallOfFame.sort((a, b) => a - b);
            answer.push(hallOfFame[0]);
        } else {
            if (hallOfFame[0] >= score[i]) answer.push(hallOfFame[0]);
            else {
                hallOfFame.shift();
                hallOfFame.push(score[i]);
                hallOfFame.sort((a, b) => a - b);
                answer.push(hallOfFame[0]);
            }
        }
    }
    return answer;
}

[Im-amberIm]

function solution(k, score) {
    const maxHeap = []
    const answer=[]
     
   for(let i = 0; i < score.length; i++){
       maxHeap.push(score[i])
       maxHeap.sort((a,b)=>b-a)
       
       if(maxHeap.length > k){
           maxHeap.pop()
       }
       
       answer.push(maxHeap[maxHeap.length-1])
   }
    
    return answer;
}

[yoorli]

function solution(k, score) {
    let honorHall = []; 
    let result = [];
    
    for (let i = 0; i < score.length; i++) {
        honorHall.push(score[i]);
        honorHall.sort((a, b) => b - a);

        if (honorHall.length > k) {
            honorHall.pop();
        }
        result.push(honorHall[honorHall.length - 1]);
    }
    return result;
}