|
| 1 | +//https://github.com/codeisneverodd/programmers-coding-test |
| 2 | +//더 좋은 풀이가 존재할 수 있습니다. |
| 3 | +//정답 1 - codeisneverodd |
| 4 | +function solution(n, k) { |
| 5 | + const getFactorial = n => { |
| 6 | + const result = [1, 1, 2, ...Array(n - 2)]; |
| 7 | + result.forEach((_, i) => { |
| 8 | + if (i > 2) result[i] = result[i - 1] * i; |
| 9 | + }); |
| 10 | + return result; |
| 11 | + }; |
| 12 | + |
| 13 | + const getDivision = (dividend, divisor) => { |
| 14 | + const quotient = Math.floor(dividend / divisor); |
| 15 | + const remainder = dividend % divisor; |
| 16 | + return [quotient, remainder]; |
| 17 | + }; |
| 18 | + |
| 19 | + const stepCount = getFactorial(n).reverse(); |
| 20 | + |
| 21 | + const generateSteps = (k, step) => { |
| 22 | + const [q, r] = getDivision(k, stepCount[step]); |
| 23 | + if (r === 0) return [q]; |
| 24 | + return [q, ...generateSteps(r, step + 1)]; |
| 25 | + }; |
| 26 | + |
| 27 | + const answer = []; |
| 28 | + |
| 29 | + const steps = generateSteps(k - 1, 0); |
| 30 | + |
| 31 | + const notUsedNums = Array.from({ length: n }, (_, i) => i + 1); |
| 32 | + |
| 33 | + steps.slice(1).forEach(q => { |
| 34 | + answer.push(notUsedNums[q]); |
| 35 | + notUsedNums.splice(q, 1); |
| 36 | + }); |
| 37 | + |
| 38 | + return [...answer, ...notUsedNums]; |
| 39 | +} |
0 commit comments