Merge pull request #526 from eric-hjh/main

[황장현] 65차 라이브 코테 제출

Author: github-actions[bot]

live6/test65/문제1/황장현.js

@@ -0,0 +1,63 @@
+const input = require('fs')
+  .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+  .toString()
+  .trim()
+  .split('\n');
+
+function solution(input) {
+  const N = Number(input[0]);
+  const board = input.slice(1).map((row) => row.split(''));
+  let max = 0;
+
+  function getMaxCandy(board) {
+    let maxLength = 0;
+
+    for (let i = 0; i < N; i++) {
+      let count = 1;
+      for (let j = 1; j < N; j++) {
+        if (board[i][j] === board[i][j - 1]) {
+          count++;
+        } else {
+          maxLength = Math.max(maxLength, count);
+          count = 1;
+        }
+      }
+      maxLength = Math.max(maxLength, count);
+    }
+
+    for (let j = 0; j < N; j++) {
+      let count = 1;
+      for (let i = 1; i < N; i++) {
+        if (board[i][j] === board[i - 1][j]) {
+          count++;
+        } else {
+          maxLength = Math.max(maxLength, count);
+          count = 1;
+        }
+      }
+      maxLength = Math.max(maxLength, count);
+    }
+
+    return maxLength;
+  }
+
+  for (let i = 0; i < N; i++) {
+    for (let j = 0; j < N; j++) {
+      if (j + 1 < N) {
+        [board[i][j], board[i][j + 1]] = [board[i][j + 1], board[i][j]];
+        max = Math.max(max, getMaxCandy(board));
+        [board[i][j], board[i][j + 1]] = [board[i][j + 1], board[i][j]];
+      }
+
+      if (i + 1 < N) {
+        [board[i][j], board[i + 1][j]] = [board[i + 1][j], board[i][j]];
+        max = Math.max(max, getMaxCandy(board));
+        [board[i][j], board[i + 1][j]] = [board[i + 1][j], board[i][j]];
+      }
+    }
+  }
+
+  return max;
+}
+
+console.log(solution(input));

live6/test65/문제2/황장현.js

@@ -0,0 +1,27 @@
+const input = require('fs')
+  .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+  .toString()
+  .trim()
+  .split('\n')
+  .map((el) => el.split(' ').map(Number));
+
+function solution(input) {
+  const N = input[0][0];
+  const schedule = input.slice(1);
+  const dp = new Array(N).fill(0);
+  for (let i = 0; i < N; i++) {
+    const [duration, profit] = schedule[i];
+
+    if (i + duration > N) {
+      continue;
+    }
+    dp[i] += profit;
+
+    for (let j = i + duration; j < N; j++) {
+      dp[j] = Math.max(dp[j], dp[i]);
+    }
+  }
+  return Math.max(...dp);
+}
+
+console.log(solution(input));

live6/test65/문제3/황장현.js

@@ -0,0 +1,15 @@
+function solution(s) {
+  const stack = [];
+
+  for (let i = 0; i < s.length; i++) {
+    if (stack[stack.length - 1] === s[i]) {
+      stack.pop();
+    } else {
+      stack.push(s[i]);
+    }
+  }
+
+  return !stack.length ? 1 : 0;
+}
+
+console.log(solution('baabaa'));