[프로그래머스] 구명보트 Python

 

https://school.programmers.co.kr/learn/courses/30/lessons/42885

프로그래머스

(1) 정답코드

from collections import deque

def solution(people, limit):
    answer = 0
    alone = []
    people.sort()
    queue = deque()
    for i in people:
        queue.append(i)
    while queue:
        if len(queue) > 1:
            min = queue.popleft()
            max = queue.pop()
            if max + min > limit:
                queue.appendleft(min)
                alone.append(max) #너무 무거우면 혼자타야해ㅠ
            else:
                answer += 1
        else:
            queue.pop()
            answer += 1
    return answer + len(alone)