Bronze2: 브루트포스, 투포인터방식으로풀이

Author: youngduck

Algorithm/BruteForce/BOJ_3040_백설공주와일곱난쟁이/BOJ_3040_백설공주와일곱난쟁이.js

@@ -0,0 +1,31 @@
+const fs = require("fs");
+const filePath =
+  process.platform === "linux" ? "/dev/stdin" : "./Z_Test/input.txt";
+let input = fs.readFileSync(filePath).toString().trim().split("\n");
+
+const arr = input.map((item) => +item);
+
+const solution = (arr) => {
+  left = 0;
+  right = 0;
+  const heightSum = arr.reduce((cur, acc) => cur + acc);
+
+  while (right < arr.length) {
+    if (right === arr.length - 1) {
+      left += 1;
+      right = left;
+    }
+
+    right += 1;
+    if (heightSum - arr[left] - arr[right] === 100) {
+      arr.map((item, index) => {
+        if (index !== right && index !== left) {
+          console.log(item);
+        }
+      });
+      break;
+    }
+  }
+};
+
+solution(arr);

Algorithm/BruteForce/BOJ_3040_백설공주와일곱난쟁이/input.txt

@@ -0,0 +1,9 @@
+8
+6
+5
+1
+37
+30
+28
+22
+36