[JS] 프로그래머스 / 코딩테스트 입문 / 체육복

---

문제

프로그래머스

---

정답

function solution(n, lost, reserve) {
  let newLost = lost
    .filter(x => !reserve.includes(x))
    .sort((a, b) => a - b);
  let newReserve = reserve
    .filter(x => !lost.includes(x))
    .sort((a, b) => a - b);

  const num = newLost.length;
  let borrow = 0;

  for (let i = 0; i < newLost.length; i++) {
    for (let j = 0; j < newReserve.length; j++) {
      if (Math.abs(newLost[i] - newReserve[j]) === 1) {
        borrow++;
        newLost[i] = "X";
        newReserve[j] = "X";
      }
    }
  }

  return n - num + borrow;
}

// 모범 답안

function solution(n, lost, reserve) {
  return (
    n - lost.filter(a => {
      const b = reserve.find(r => Math.abs(r - a) <= 1);
      if (!b) return true;
      reserve = reserve.filter(r => r !== b);
    }).length
  );
}

---