내가 푼 코드
function solution(k, score) {
const result = [score[0]];
let arr = [score[0]];
for (let i=1; i<score.length; i++) {
arr.push(score[i]);
if (arr.length <= k) {
arr.sort(function(a, b) {
return b - a;
});
result.push(arr[arr.length - 1])
} else {
arr.sort(function(a, b) {
return b - a;
});
arr = arr.slice(0, k);
result.push(arr[k-1])
}
}
return result
}
남들이 푼 코드
function solution(k, score) {
const stack = []
return score.reduce((a,c) => {
if(stack.length < k) {
stack.push(c)
stack.sort((a,b) => a - b)
}
else {
stack.push(c)
stack.sort((a,b) => a - b)
stack.shift()
}
a.push(stack[0])
return a
},[])
}