Merge pull request #655 from eric-hjh/main

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

Author: github-actions[bot]

live9/test98/문제1/황장현.js

@@ -0,0 +1,30 @@
+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, M] = input[0];
+  const numArr = [0, ...input[1]];
+
+  function bF(idx, sec, size) {
+    if (sec > M) return 0;
+    if (sec === M || idx >= N) return size;
+
+    let ans = 0;
+    ans = Math.max(
+      idx + 1 <= N ? bF(idx + 1, sec + 1, size + numArr[idx + 1]) : 0,
+      idx + 2 <= N
+        ? bF(idx + 2, sec + 1, Math.floor(size / 2) + numArr[idx + 2])
+        : 0
+    );
+
+    return ans;
+  }
+
+  return bF(0, 0, 1);
+}
+
+console.log(solution(input));

live9/test98/문제2/황장현.js

@@ -0,0 +1,36 @@
+const input = require('fs')
+  .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+  .toString()
+  .trim();
+
+function solution(input) {
+  const digits = input.split('');
+  const visited = Array(digits.length).fill(false);
+  let found = Infinity;
+
+  function dfs(current) {
+    if (current.length === digits.length) {
+      const num = parseInt(current.join(''), 10);
+      if (num > parseInt(input, 10)) {
+        found = Math.min(found, num);
+      }
+      return;
+    }
+
+    for (let i = 0; i < digits.length; i++) {
+      if (!visited[i]) {
+        visited[i] = true;
+        current.push(digits[i]);
+        dfs(current);
+        current.pop();
+        visited[i] = false;
+      }
+    }
+  }
+
+  dfs([]);
+
+  return found === Infinity ? 0 : found;
+}
+
+console.log(solution(input));

live9/test98/문제3/황장현.js

@@ -0,0 +1,28 @@
+function solution(prices) {
+  const stack = [],
+    result = Array(prices.length)
+      .fill(0)
+      .map((_, idx) => idx)
+      .reverse();
+  const visited = [];
+
+  prices.forEach((price, idx) => {
+    const sLastIdx = stack.length - 1;
+
+    if (price < stack[sLastIdx]) {
+      let backTrackingIdx = 0;
+
+      while (price < stack[sLastIdx - backTrackingIdx]) {
+        if (!visited[sLastIdx - backTrackingIdx]) {
+          result[sLastIdx - backTrackingIdx] -= prices.length - 1 - idx;
+          visited[sLastIdx - backTrackingIdx] = true;
+        }
+        backTrackingIdx++;
+      }
+    }
+    stack.push(price);
+  });
+  return result;
+}
+
+console.log(solution([1, 2, 3, 2, 3]));