Merge pull request boost-algorithm#51 from kyu9341/master

kyu9341 · web-flow · commit 44d371c738af · 2020-12-31T17:39:14.000+09:00
week14 문제 풀이
diff --git a/src/kyu9341/programmers_가장긴팰린드롬/index.js b/src/kyu9341/programmers_가장긴팰린드롬/index.js
@@ -0,0 +1,35 @@
+const getLongestPalindrome = (left, right, arrFromStr) => {
+  let maxLength = 0;
+  const isInRange = (left, right) => left >= 0 && right < arrFromStr.length;
+
+  while (isInRange(left, right)) {
+    if (arrFromStr[left] !== arrFromStr[right]) return maxLength;
+
+    maxLength = right - left + 1;
+    left -= 1;
+    right += 1;
+  }
+
+  return maxLength;
+};
+
+const solution = s => {
+  let maxLength = 0;
+  const arrFromStr = [...s];
+
+  const checkLength = (_, index) => {
+    const odd = getLongestPalindrome(index, index, arrFromStr);
+    const even = getLongestPalindrome(index, index + 1, arrFromStr);
+    maxLength = Math.max(maxLength, Math.max(odd, even));
+  };
+
+  arrFromStr.forEach(checkLength);
+
+  return maxLength;
+};
+
+(() => {
+  const inputs = ['abcdcba', 'abacde'];
+
+  inputs.forEach(input => console.log(solution(input)));
+})();
diff --git a/src/kyu9341/programmers_크레인인형뽑기게임/index.js b/src/kyu9341/programmers_크레인인형뽑기게임/index.js
@@ -0,0 +1,38 @@
+const range = (start, end) =>
+  start < end ? Array.from({ length: end - start + 1 }, (_, idx) => idx + start) : [];
+
+const solution = (board, moves) => {
+  let count = 0;
+  const stack = [];
+
+  const pickDoll = col => {
+    for (const row of range(0, board.length - 1)) {
+      const currentDoll = board[row][col - 1];
+      board[row][col - 1] = 0;
+
+      const isExist = currentDoll !== 0;
+      const isEqualToPrevDoll = stack[stack.length - 1] === currentDoll;
+
+      if (isExist) {
+        if (isEqualToPrevDoll) {
+          stack.pop();
+          count += 2;
+          break;
+        }
+        stack.push(currentDoll); 
+        break;
+      }
+    }
+  };
+  
+  moves.forEach(pickDoll);
+  return count;
+}
+
+(() => {
+  const board = [[0,0,0,0,0],[0,0,1,0,3],[0,2,5,0,1],[4,2,4,4,2],[3,5,1,3,1]];
+  const moves = [1,5,3,5,1,2,1,4];
+
+  console.log(solution(board, moves));
+})();
+
diff --git a/src/kyu9341/programmers_튜플/index.js b/src/kyu9341/programmers_튜플/index.js
@@ -0,0 +1,26 @@
+const parseStringToArray = str => str.substring(2, str.length - 2)
+                                .split("},{")
+                                .map(el => el.split(',').map(str => Number(str)));
+
+const solution = s => {
+  const set = new Set();
+  const arr = parseStringToArray(s);
+  
+  const compareLength = (prev, cur) => prev.length - cur.length;
+  arr.sort(compareLength).flat().forEach(el => set.add(el));;
+
+  return [...set];
+}
+
+(() => {
+  const inputs = [
+    "{{2},{2,1},{2,1,3},{2,1,3,4}}",
+    "{{1,2,3},{2,1},{1,2,4,3},{2}}",
+    "{{20,111},{111}}",
+    "{{123}}",
+    "{{4,2,3},{3},{2,3,4,1},{2,3}}",
+  ];
+
+  inputs.forEach(input => console.log(solution(input)));
+})();
+
