Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
48 lines (36 loc) · 928 Bytes

File metadata and controls

48 lines (36 loc) · 928 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
"""
문제링크 : https://programmers.co.kr/learn/courses/30/lessons/42586
입력예시
progresses
[93, 30, 55]
[95, 90, 99, 99, 80, 99]
speeds
[1, 30, 5]
[1, 1, 1, 1, 1, 1]
결과예시
[2, 1]
[1, 3, 2]
"""
def solution(progresses, speeds):
answer = []
while (len(progresses) > 0):
count = 0
for i in range(len(progresses)):
progresses[i] = progresses[i] + speeds[i]
for i in range(len(progresses)):
if progresses[i] >= 100:
progresses[i] = 0
count += 1
else:
break
if count > 0:
answer.append(count)
tempPro = []
tempSpe = []
for i in range(len(progresses)):
if progresses[i] != 0:
tempPro.append(progresses[i])
tempSpe.append(speeds[i])
progresses = tempPro
speeds = tempSpe
return answer
Morty Proxy This is a proxified and sanitized view of the page, visit original site.