Merge pull request #607 from eric-hjh/main

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

Author: github-actions[bot]

live8/test88/문제1/황장현.js

@@ -0,0 +1,26 @@
+function solution(sequence, k) {
+  let start = 0;
+  let end = 0;
+  let sum = sequence[0];
+  let minLength = Infinity;
+  let answer = [];
+
+  while (end < sequence.length) {
+    if (sum === k) {
+      if (end - start < minLength) {
+        minLength = end - start;
+        answer = [start, end];
+      }
+      sum -= sequence[start++];
+    } else if (sum < k) {
+      end++;
+      if (end < sequence.length) sum += sequence[end];
+    } else {
+      sum -= sequence[start++];
+    }
+  }
+
+  return answer;
+}
+
+console.log(solution([1, 1, 1, 2, 3, 4, 5], 5));

live8/test88/문제2/황장현.js

@@ -0,0 +1,34 @@
+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 A = input[1];
+  const B = input[2];
+  let p1 = 0;
+  let p2 = 0;
+
+  const result = [];
+
+  while (p1 < N && p2 < M) {
+    if (A[p1] < B[p2]) {
+      result.push(A[p1++]);
+    } else if (A[p1] > B[p2]) {
+      result.push(B[p2++]);
+    } else {
+      result.push(A[p1], B[p2]);
+      p1++;
+      p2++;
+    }
+  }
+  while (p1 < N) result.push(A[p1++]);
+  while (p2 < M) result.push(B[p2++]);
+
+  return result.join(' ');
+}
+
+console.log(solution(input));

live8/test88/문제3/황장현.js

@@ -0,0 +1,30 @@
+function solution(n, lost, reserve) {
+  let 진짜두고온애들 = lost
+    .filter((l) => !reserve.includes(l))
+    .sort((a, b) => a - b);
+
+  let 진짜빌려줄수있는애들 = reserve
+    .filter((r) => !lost.includes(r))
+    .sort((a, b) => a - b);
+
+  let answer = n - 진짜두고온애들.length;
+
+  for (let i = 0; i < 진짜두고온애들.length; i++) {
+    const 진짜두고온애 = 진짜두고온애들[i];
+
+    for (let j = 0; j < 진짜빌려줄수있는애들.length; j++) {
+      const 진짜빌려줄수있는애 = 진짜빌려줄수있는애들[j];
+      if (
+        진짜빌려줄수있는애 === 진짜두고온애 - 1 ||
+        진짜빌려줄수있는애 === 진짜두고온애 + 1
+      ) {
+        answer += 1;
+        진짜빌려줄수있는애들[j] = -1;
+        break;
+      }
+    }
+  }
+  return answer;
+}
+
+console.log(solution(5, [2, 4], [1, 3, 5]));