.

dnacu · dnacu · commit 734e3ba5ff70 · 2020-05-21T17:09:25.000+09:00
diff --git a/PROGRAMMERS/SW Coding(2019)/종이접기.js b/PROGRAMMERS/SW Coding(2019)/종이접기.js
@@ -0,0 +1,10 @@
+function solution(n) {
+  let answer = [0];
+  for(let i =1; i<n; i++){
+      let reverse = answer.slice().reverse()
+      reverse = reverse.map(r => r===0?1:0)
+      answer.push(0);
+      answer = answer.concat(reverse);
+  }
+  return answer;
+}
diff --git a/PROGRAMMERS/SW Coding(~2018)/숫자게임.js b/PROGRAMMERS/SW Coding(~2018)/숫자게임.js
@@ -0,0 +1,14 @@
+function solution(A, B) {
+  var answer = 0;
+  A.sort((a,b) => b-a);
+  B.sort((a,b) => b-a);
+  let j = 0;
+  let blen = B.length;
+  for(let i=0; i<A.length; i++){
+      if(A[i] < B[j]){
+          answer++;
+          j++;
+      }
+  }
+  return answer;
+}
diff --git a/PROGRAMMERS/SW Coding(~2018)/영어끝말잇기.js b/PROGRAMMERS/SW Coding(~2018)/영어끝말잇기.js
@@ -0,0 +1,38 @@
+const solution = (n, words) => {
+  const answer = [0, 0];
+
+  // n은 사람 수, words는 단어배열
+  const wsize = words.length;
+  const setAnswer = (a, b) => {
+    answer[0] = a;
+    answer[1] = b;
+  };
+
+  let num = 0,
+    order = 0;
+  const wordList = {};
+
+  for (let i = 0; i < wsize; i++) {
+    // i+1은 현재 진행횟수
+    // (i+1)%n은 번호
+    // Math.floor((i+1)/n)은 몇번째차례인지
+    num = (i + 1) % n || n;
+    order = Math.floor(i / n) + 1;
+
+    // 이전 단어끝이랑 다르면
+    if (i > 0 && words[i - 1][words[i - 1].length - 1] !== words[i][0]) {
+      setAnswer(num, order);
+      break;
+    }
+
+    // 이미 말했던 단어면
+    if (wordList[words[i]]) {
+      setAnswer(num, order);
+      break;
+    } else {
+      wordList[words[i]] = true;
+    }
+  }
+
+  return answer;
+};
diff --git a/PROGRAMMERS/동적계획법(Dynamic Programming)/타일장식물.js b/PROGRAMMERS/동적계획법(Dynamic Programming)/타일장식물.js
@@ -0,0 +1,8 @@
+function solution(N) {
+  let fib = [0, 1, 1];
+  for(let i=2; i<N; i++) {
+      fib.push(fib[i] + fib[i-1]);
+  }
+  
+  return fib[N]*2 + (fib[N]+fib[N-1])*2;
+}
