Add 1 solution.

Author: codeisneverodd

level-2/[3차]-n진수-게임.js

@@ -0,0 +1,16 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1 - codeisneverodd
+function solution(n, t, m, p) {
+    let queue = [], result = [], currentNumDecimal = -1, turn = 0
+    while (result.length < t) {
+        if (queue.length === 0) {
+            currentNumDecimal++
+            currentNumDecimal.toString(n).split('').forEach(x => queue.push(x))
+        }
+        const currentChar = queue.shift()
+        if (turn % m === p - 1) result.push(currentChar)
+        turn++
+    }
+    return result.join('').toUpperCase()
+}