https://programmers.co.kr/learn/courses/30/lessons/42889
def solution(N, stages):
answer = []
rate={}
s=len(stages)
for i in range(1, N+1):
if s==0:
rate[i]=0
else:
cnt=stages.count(i)
rate[i]=cnt/s
s-=cnt
answer=sorted(rate, key=lambda x:rate[x], reverse=True)
return answer
sorted(rate, key=lambda x:rate[x], reverse=True)
: 딕셔너리에서 value를 기준으로 내림차순def solution(N, stages):
answer = []
rate={}
s=len(stages)
for i in range(1, N+1):
cnt=0
for j in range(s):
if stages[j]==i:
cnt+=1
if cnt==0:
rate[i]=0
else:
rate[i]=cnt/s
s-=cnt
answer=sorted(rate, key=lambda x:rate[x], reverse=True)
return answer