<프로그래머스 문제풀이: [스택/큐] 기능 개발> Level 2 - 파이썬
꽤 오래 고민한 문제이다: def solution(progresses, speeds): days_needed = [] for progress, speed in zip(progresses, speeds): day = (100-progress)/speed if day == int(day): days_needed.append(int(day)) else: days_needed.append(int(day)+1) answer = [] while True: big_num = days_needed.index(max(days_needed)) if big_num == 0: answer.append(len(days_needed)) break answer.append(len(days_needed)-big_num) days_n..
