06.19에 푼 문제입니다🌷
구명보트
function solution(people, limit) {
var answer = 0;
people.sort((a,b)=>a-b)
while(people.length!==0){
let p = people.shift()
let i = people.length-1
for(;p+people[i]>limit;i--){}
if(i!==-1)
people=[...people.slice(0,i),...people.slice(i+1)]
answer++
}
return answer;
}
function solution(people, limit) {
var answer = 0;
people.sort((a,b)=>a-b)
let min = people.shift()
let max = people.pop()
answer++
while(people.length!==0){
if(min+max<=limit){
min = people.shift()
max = people.pop()
}
else{
max = people.pop()
}
answer++
}
if(min+max>limit) answer++
return answer;
}