해결된 질문
작성
·
147
0
let n = 8;
let k = 3;
console.log(solution(n, k));
function solution(n, k) {
let princes = Array.from({ length: n }, (value, idx) => idx + 1);
let cnt = 0;
while (princes.length >= 2) {
if (cnt === k - 1) princes.splice(0, 1), (cnt = 0);
else princes.push(princes.shift()), cnt++;
}
return +princes;
}
감사합니다.