We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b29f3e1 commit 03aaedaCopy full SHA for 03aaeda
programmers/Lv.1/failure_percent.py
@@ -1,11 +1,12 @@
1
def solution(N, stages):
2
- stage_score = []
3
- for i in range(N + 2):
4
- stage_score.append([i, 0, 0])
+ # stage별 도달 참가자 수 구하기
+ stage_score = [0] * (N + 2)
5
for stage in stages:
6
- stage_score[stage][1] += 1
+ stage_score[stage] += 1
+ # 각 stage별 실패율과 stage 저장하기
7
+ stage_info = []
8
for i in range(1, N + 1):
- stage_score[stage][2] = stage_score[i][1] / sum(stage_score[i:N + 2])
9
- print(stage_score)
10
- answer = []
11
- return answer
+ stage_info.append([i, stage_score[i] / sum(stage_score[i:N + 2])])
+ # 실패율을 기준으로 내림차순으로 정리
+ stage_info.sort(key=lambda x:-x[1])
12
+ return [i[0] for i in stage_info]
0 commit comments