기능개발

기능개발 - 프로그래머스

def solution(progresses, speeds):
    deploy, ret = [], []
    deploy.extend(reversed(progresses))
    speeds.reverse()
    while deploy:
        idx = 0
        cnt = 0
        for i, j in zip(deploy, speeds):
            deploy[idx] = i + j
            idx += 1
        if deploy[-1] >= 100:
            while deploy[-1] >= 100:
                cnt += 1
                deploy.pop(-1)
                speeds.pop(-1)
                if not deploy:
                    break
            ret.append(cnt)
    return ret