22 Tue
์คํจ์จ
'''
https://programmers.co.kr/learn/courses/30/lessons/42889
์คํจ์จ
[ํ์ด]
0. ์คํ
์ด์ง์ ๋๋ฌํ์ผ๋ ์์ง ํด๋ฆฌ์ดํ์ง ๋ชปํ ํ๋ ์ด์ด์ ์ / ์คํ
์ด์ง์ ๋๋ฌํ ํ๋ ์ด์ด ์
1. ์คํจ์จ์ ์ค๋ฆ์ฐจ์๊ณผ ๋ด๋ฆผ์ฐจ์์ด ์์ฌ์๋ ๊ธฐ์ค์ผ๋ก ์ ๋ ฌ ํ๊ธฐ
2. key = (x[0], -x[1])์ ์ฌ์ฉํ๋ฉด ์์ฌ์๋ ์ ๋ ฌ ๊ฐ๋ฅ.
'''
def solution(N, stages):
failure = [stages.count(i) for i in range(1, N+2)]
play = [sum(failure[i:]) for i in range(N)]
rate = [(i, v[0]/v[1]) if v[1] != 0 else (i, v[0] and 1) for i, v in enumerate([a, b] for a, b in zip(failure, play))]
return list(map(lambda x : x[0]+1, sorted(rate, key=lambda x: (x[1], -x[0]), reverse=True)))
'''
'''
Last updated
Was this helpful?