forked from ndb796/python-for-coding-test
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path3.py
25 lines (20 loc) Β· 763 Bytes
/
3.py
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
def solution(N, stages):
answer = []
length = len(stages)
# μ€ν
μ΄μ§ λ²νΈλ₯Ό 1λΆν° NκΉμ§ μ¦κ°μν€λ©°
for i in range(1, N + 1):
# ν΄λΉ μ€ν
μ΄μ§μ λ¨Έλ¬Όλ¬ μλ μ¬λμ μ κ³μ°
count = stages.count(i)
# μ€ν¨μ¨ κ³μ°
if length == 0:
fail = 0
else:
fail = count / length
# 리μ€νΈμ (μ€ν
μ΄μ§ λ²νΈ, μ€ν¨μ¨) μμ μ½μ
answer.append((i, fail))
length -= count
# μ€ν¨μ¨μ κΈ°μ€μΌλ‘ κ° μ€ν
μ΄μ§λ₯Ό λ΄λ¦Όμ°¨μ μ λ ¬
answer = sorted(answer, key=lambda t: t[1], reverse=True)
# μ λ ¬λ μ€ν
μ΄μ§ λ²νΈ λ°ν
answer = [i[0] for i in answer]
return answer