solve: programmers 영어끝말잇기

Do-ho · Do-ho · commit 448f895d96b9 · 2021-01-06T18:52:48.000+09:00
- 단순 구현 문제
diff --git a/src/Do-ho/implementation/pgs_영어끝말잇기/pgs_영어끝말잇기.js b/src/Do-ho/implementation/pgs_영어끝말잇기/pgs_영어끝말잇기.js
@@ -0,0 +1,21 @@
+const solution = (n, words) => {
+    let [people, order] = [0, 0];
+    let prevText = null;
+    let wordSet = [];
+    const isNotPrevTextNull = () => prevText !== null;
+    const isNotMatchWord = (word) => prevText[prevText.length - 1] !== word[0];
+    const isContainWordSet = (word) => wordSet.includes(word);
+    
+    for (let i=0; i<words.length; i++) {
+        const word = words[i];
+        if(isNotPrevTextNull() && (isNotMatchWord(word) || isContainWordSet(word))) {
+            people = (i % n) + 1;
+            order = Math.floor(i / n) + 1;
+            break;
+        }
+        prevText = word;
+        wordSet.push(word);
+    }
+    
+    return [people, order];
+}
