Merge pull request #523 from eric-hjh/main

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

Author: eric-hjh

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

@@ -0,0 +1,22 @@
+const input = require('fs')
+  .readFileSync(process.platform === 'linux' ? '/dev/stdin' : './input.txt')
+  .toString()
+  .trim();
+
+function solution(input) {
+  const numberStruct = input.split('').map(Number);
+
+  if (!numberStruct.includes(0)) return -1;
+
+  const sum = numberStruct.reduce(
+    (totalSum, currentNumber) => totalSum + currentNumber,
+    0
+  );
+  if (sum % 3 !== 0) return -1;
+
+  numberStruct.sort((a, b) => b - a);
+
+  return numberStruct.join('');
+}
+
+console.log(solution(input));

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

@@ -0,0 +1,36 @@
+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, K] = input[0];
+  const field = input.slice(1);
+
+  const maxPosition = 1000000;
+  const ice = new Array(maxPosition + 1).fill(0);
+
+  for (const [gi, xi] of field) {
+    ice[xi] += gi;
+  }
+
+  let maxSum = 0;
+  let currentSum = 0;
+
+  for (let i = 0; i <= Math.min(2 * K, maxPosition); i++) {
+    currentSum += ice[i];
+  }
+  maxSum = currentSum;
+
+  for (let i = 1; i + 2 * K <= maxPosition; i++) {
+    currentSum -= ice[i - 1];
+    currentSum += ice[i + 2 * K];
+    maxSum = Math.max(maxSum, currentSum);
+  }
+
+  return maxSum;
+}
+
+console.log(solution(input));

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

@@ -0,0 +1,37 @@
+function solution(cacheSize, cities) {
+  let answer = 0;
+  let cityArr = [];
+
+  for (let i = 0; i < cities.length; i++) {
+    let current = cities[i].toLowerCase();
+    let findCity = cityArr.find((city) => city === current);
+    if (!findCity) {
+      cityArr.push(current);
+      if (cityArr.length > cacheSize) {
+        cityArr.shift();
+      }
+      answer += 5;
+    } else {
+      cityArr = cityArr.filter((city) => city !== current);
+      cityArr.push(current);
+      answer++;
+    }
+  }
+
+  return answer;
+}
+
+console.log(
+  solution(3, [
+    'Jeju',
+    'Pangyo',
+    'Seoul',
+    'NewYork',
+    'LA',
+    'Jeju',
+    'Pangyo',
+    'Seoul',
+    'NewYork',
+    'LA',
+  ])
+);