H-Index

210723

'''
https://programmers.co.kr/learn/courses/30/lessons/42747#
H-Index
1. ๋ฌธ์ œ ์„ค๋ช…๋Œ€๋กœ ๋น„๊ต. 1000ํŽธ ์ดํ•˜์ด๋ฏ€๋กœ 2์ค‘ ๋ฐ˜๋ณต๋ฌธ ์‚ฌ์šฉ ๊ฐ€๋Šฅ.
2. all์„ ์‚ฌ์šฉํ•ด์„œ i <=j ์™€ j >= i๋ฅผ ๋ชจ๋‘ ๋งŒ์กฑํ•˜๋ฉด return
'''
def solution(citations):
    citations.sort(reverse=True)
    for i in range(len(citations), 0, -1):
        if all([j >= i for j in citations[:i]]) and all([j <= i for j in citations[i:]]): return i
    return 0
'''
์„ธ์ƒ์— ๊ณ ์ˆ˜๋Š” ๋งŽ๋‹ค..
1) ์ด์ค‘ ๋ฐ˜๋ณต๋ฌธ์„ ์•ˆ์จ๋„ ๋˜๋Š” ๋น„๊ต
def solution(citations):
    citations = sorted(citations)
    l = len(citations)
    for i in range(l):
        if citations[i] >= l-i:
            return l-i
    return 0
    
2) ใ„นใ…‡ ๊ณ ์ธ๋ฌผ. ์‘์šฉ๋ ฅ์ด ๋ง๋„ ์•ˆ๋จ
def solution(citations):
    citations.sort(reverse=True)
    answer = max(map(min, enumerate(citations, start=1)))
    return answer
'''

Last updated

Was this helpful?