프로그래머스 문제기록
[스택/큐] 3. 기능개발
코딩펭귄
2023. 10. 20. 18:05
시간초과된 내가쓴 코드
def solution(progresses, speeds):
answer = []
result = []
cnt = 1
for i in range(len(progresses)):
answer.append((100-progresses[i])/speeds[i])
for i in range(len(answer)):
if 0 < answer[i] - int(answer[i]) < 1:
answer[i] = int(answer[i])
while len(answer) > 0:
maxnum = answer[0]
for i in range(len(answer)):
if i <= maxnum:
cnt += 1
else:
result.append(cnt)
answer.remove(answer[0:i+1])
cnt = 1
break
return result