PROGRAMMERS 42885: 구명보트

Link : programmers.co.kr/learn/courses/30/lessons/42885

---

Python

def solution(people, limit):
    people.sort(reverse=True)
    counter = 0
 
    s_tp = 0
    e_tp = len(people) - 1
    while e_tp - s_tp >= 0:
        if people[s_tp] + people[e_tp] <= limit:
            s_tp += 1
            e_tp -= 1
            counter += 1
        else:
            s_tp += 1
            counter += 1
    return counter
 

FeedBack

1.  

---

 

 

 

cjw.git@gmail.com