[프로그래머스] Lv2. 구명보트 - Javascript

문제링크

문제풀이

function solution(people, limit) {
  let answer = 0;
  people.sort((a, b) => a - b);
  const n = people.length;
  let p1 = 0;
  let p2 = n - 1;
  while (p1 <= p2) {
    if (people[p1] + people[p2] > limit) {
      p2--;
    } else {
      p2--;
      p1++;
    }
    answer++;
  }
  return answer;
}