Merge pull request #611 from sangminlee98/main

[이상민] 88차 라이브 코테 제출

Author: github-actions[bot]

live8/test88/문제1/이상민.js

@@ -0,0 +1,20 @@
+function solution(sequence, k) {
+  let answer;
+  let l = 0;
+  let sum = 0;
+  let min = Number.MAX_SAFE_INTEGER;
+  for (let r = 0; r < sequence.length; r++) {
+    sum += sequence[r];
+    while (sum > k) {
+      sum -= sequence[l];
+      l++;
+    }
+    if (sum === k) {
+      if (r - l < min) {
+        min = r - l;
+        answer = [l, r];
+      }
+    }
+  }
+  return answer;
+}

live8/test88/문제2/이상민.js

@@ -0,0 +1,18 @@
+const input = require("fs")
+  .readFileSync(process.platform === "linux" ? "/dev/stdin" : "./input.txt")
+  .toString()
+  .trim()
+  .split("\n");
+
+input.shift();
+
+const tmp = [];
+
+for (const i of input) {
+  const arr = i.split(" ").map(Number);
+  for (const j of arr) {
+    tmp.push(j);
+  }
+}
+
+console.log(tmp.sort((a, b) => a - b).join(" "));

live8/test88/문제3/이상민.js

@@ -0,0 +1,25 @@
+function solution(n, lost, reserve) {
+  lost.sort();
+  reserve.sort();
+  let arr = [...lost];
+  lost.map((item) => {
+    if (reserve.includes(item)) {
+      arr.splice(arr.indexOf(item), 1);
+      reserve.splice(reserve.indexOf(item), 1);
+    }
+  });
+  let newArr = [...arr];
+
+  for (let i = 0; i < arr.length; i++) {
+    if (reserve.includes(arr[i] - 1) || reserve.includes(arr[i] + 1)) {
+      if (reserve.includes(arr[i] - 1)) {
+        reserve.splice(reserve.indexOf(arr[i] - 1), 1);
+        newArr.shift();
+        continue;
+      }
+      reserve.splice(reserve.indexOf(arr[i] + 1), 1);
+      newArr.shift();
+    }
+  }
+  return n - newArr.length;
+}