[20251118] PGM / LV2 / H-Index / 김민진 #1445
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
H-Index
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
논문 인용 수
h에 대해서h이상 인용된 논문이h개 이상이고h이하로 인용된 논문의 수가h이하를 만족하는 수를 H-Index라고 함H-Index 중 가장 큰 수
🔍 풀이 방법
정렬 + 순차탐색
len - i편의 논문이citations[i]이상의 인용을 받는 경우를 확인논문
h편이h번 이상 인용되어야하기 때문에 둘 중 최솟값이h후보가 됨순차탐색하면서 가장 큰
h를 찾으면 됨⏳ 회고