본문 바로가기

알고리즘&자료구조/Programmers

[프로그래머스] 코딩테스트 연습 > 스택/큐 > 기능개발

https://programmers.co.kr/learn/courses/30/lessons/42586

def solution(progresses, speeds):
    answer = []
    left = [100-leftover for leftover in progresses]
    max = 0
    for i in range(len(left)):
        if left[i]%speeds[i] != 0 :
            a = left[i]//speeds[i] + 1
        else : a = left[i]//speeds[i]

        if a <= max:
            answer[-1] = answer[-1] + 1
        else:
            max = a
            answer.append(1)

    return answer
def solution(progresses, speeds):
    answer = []
    max = 0
    for i in range(len(speeds)):
        a = -((progresses[i]-100)//speeds[i])
        if a <= max:
            answer[-1] = answer[-1] + 1
        else:
            max = a
            answer.append(1)
        
    return answer