🎲 백준 1253번 좋다

🧸 다음엔 이분탐색 응용문제에 도전해봐야겠다!

코드

const fs = require('fs'); 
const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');
const N = +input.shift();
const number = input[0]
  .split(" ")
  .map(Number)
  .sort((a, b) => a - b);

let answer = 0;

for (let i = 0; i < N; i++) {
  const target = number[i];
  const numberCopy = [...number];
  numberCopy.splice(i, 1);
  let left = 0;
  let right = N - 2;
  while (left < right) {
    if (target === numberCopy[left] + numberCopy[right]) {
      answer++;
      break;
    } else if (target < numberCopy[left] + numberCopy[right]) right--;
    else left++;
  }
}

console.log(answer);